#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; ll L; cin >> N >> L;

    vector<ll> d(N), a(2*N);
    rep(i, N) cin >> d[i];
    rep(i, 2*N) cin >> a[i];

    ll K = -1;
    rep(i, N){
        if((a[i]+a[N+i])%L != 0){
            cout << "No\n";
            return 0;;
        }
        if(K != -1 && K != (a[i]+a[N+i])/L){
            cout << "No\n";
            return 0;
        }
        K = (a[i]+a[N+i])/L;
    }

    vector<ll> c(2*N);
    rep(i, 2*N){
        ll x;

        if(i%N == 0){
            x = L+d[0]-d[N-1];
        }
        else{
            x = d[i%N]-d[(i-1)%N];
        }

        ll y = a[i]-a[(i+2*N-1)%(2*N)];

        if(K*x-y < 0 || (K*x-y)%(2*x) != 0){
            cout << "No\n";
            return 0;
        }
        c[i] = (K*x-y)/(2*x);
    }

    //rep(i, 2*N) cout << c[i]<< ' '; cout << '\n';

    ll T = K;

    vector<ll> b(2*N, 0);
    rep(i, N){
        ll x = c[i]-c[i+1];
        if(x > 0) b[i] += x;
        else b[N+i] -= x;
        T -= abs(x);
    }

    if(T < 0 || (T&1)){
        cout << "No\n";
        return 0;
    }

    //cout << K << ' ' << T << '\n';
    //rep(i, 2*N) cout << b[i] << ' '; cout << '\n';

    vector<ll> res(2*N, L*(T/2));
    rep(i, 2*N){
        rep(j, 2*N){
            ll x = (i < N? d[i] : L+d[i%N]);
            ll y = (j < N? d[j] : L+d[j%N]);

            if(x > y) swap(x, y);
            res[j] += b[i]*min(y-x, 2*L-(y-x));
        }
    }

    rep(i, 2*N){
        if(a[i] != res[i]){
            cout << "No\n";
            return 0;
        }
    }

    cout << "Yes\n";
}