#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n; ll l; cin>>n>>l;
    ll d[101];
    for(int i=0; i<n; i++){
        cin>>d[i];
    }
    ll b[202];
    ll s=0;
    for(int i=0; i<2*n; i++){
        cin>>b[i];
        s+=b[i];
    }
    if(s%(n*l)!=0){
        cout<<"No"<<endl;
        return 0;
    }
    ll c=s/(n*l);
    ll x[202];
    for(int i=0; i<2*n; i++){
        ll x1=d[i%n];
        if(i>=n) x1+=l;
        ll x2=d[(i+1)%n];
        if(n<=i+1 && i+1<2*n) x2+=l;
        else if(i+1>=2*n) x2+=2*l;
        x[i]=x2-x1;
    }
    ll y[202];
    for(int i=0; i<2*n; i++){
        y[i]=(b[(i+1)%(2*n)]-b[i]);
    }
    for(int i=0; i<2*n; i++){
        if(y[i]%x[i]!=0){
            cout<<"No"<<endl;
            return 0;
        }
        y[i]/=x[i];
    }
    ll z[202];
    for(int i=0; i<2*n; i++){
        z[i]=y[(i+1)%(2*n)]-y[i];
    }
    for(int i=0; i<n; i++){
        if(z[i]+z[i+n]!=0 || z[i]%2!=0){
            cout<<"No"<<endl;
            return 0;
        }
        z[i]/=2;
    }
    ll t=0;
    for(int i=0; i<n; i++){
        t+=abs(z[i]);
    }
    if(t<=c && (c-t)%2==0){
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
    return 0;
}