#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;
const int INF=1<<30;
const LL MAX=1e9+7;

void array_show(int *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
template<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){
    int n=v1.size();
    for(int i=0;i<n;i++){
        if(i)os<<" ";
        os<<v1[i];
    }
    return os;
}
template<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){
    os<<p.first<<" "<<p.second;
    return os;
}
template<typename T> istream& operator>>(istream& is,vector<T>& v1){
    int n=v1.size();
    for(int i=0;i<n;i++)is>>v1[i];
    return is;
}
template<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){
    is>>p.first>>p.second;
    return is;
}

namespace sol{

    void solve(){
        LL n,m;
        int i,j,k;
        LL a,b,c;
        cin>>n>>m;
        vector<LL> v1(n),v2(2*n),vs(2*n);
        cin>>v1>>v2;
        auto dis=[&](int pos){
            pos%=n;
            if(pos==n-1)return v1[0]+m-v1.back();
            return v1[pos+1]-v1[pos];
        };
        for(i=0;i<2*n;i++){
            a=v2[(i+1)%(2*n)]-v2[i];
            if(abs(a)%dis(i)){
                cout<<"No"<<endl;
                return;
            }
            a/=dis(i);
            vs[i]+=a,vs[(i+1)%(2*n)]-=a;
        }
        a=0;
        for(i=0;i<n;i++){
            if(vs[i]!=-vs[n+i] || abs(vs[i])%2==1){
                cout<<"No"<<endl;
                return;
            }
            
            if(vs[i]>=0)a+=vs[i]/2*(v1[i]-v1[0]);
            else a+=vs[n+i]/2*(m-(v1[i]-v1[0]));
            if(a>=INF){
                cout<<"No"<<endl;
                return;
            }
        }
        if(a<=v2[0] && (v2[0]-a)%m==0)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    sol::solve();
}