#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}


//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	ll N,L;
	cin>>N>>L;
	vector<ll> d(2*N);
	vector<ll> B(N*2);
	rep(i,N) cin>>d[i];
	rep(i,N) d[i+N]=d[i]+L;
	rep(i,N*2) cin>>B[i];
	rep(i,N-1){
		if((B[i]+B[i+N])!=(B[i+1]+B[i+N+1])){
			yneos(0);
			return 0;
		}
	}
	ll C=B[0]+B[N];
	if(C%L!=0){
		yneos(0);
		return 0;
	}
	C/=L;
	ll X[N+1];
	ll T[2*N]={0};
	rep(i,N+1){
		ll BB=B[(i+1)]-B[i];
		ll DD=d[(i+1)]-d[i];
		//cout<<BB<<endl;
		if(BB%DD!=0){
			yneos(0);
			return 0;
		}
		X[i]=BB/DD;
		if((C-X[i]+Q*2)%2!=0){
			yneos(0);
			return 0;
		}
	}
	//cout<<endl;
	rep(i,N+1){
		X[i]=(C-X[i])/2;
	}
	rep(i,N){
		ll A=X[i+1]-X[i];
		if(A<0) T[i+1]=A*-1;
		else T[(i+1+N)%(2*N)]=A;
	}
	rep(i,2*N) rep(j,2*N){
		ll dis=abs(d[i]-d[j]);
		B[i]-=T[j]*(min(dis,2*L-dis));
	}
	//rep(i,N*2) cout<<B[i]<<endl;
	yneos(B[0]>=0&&B[0]%L==0);
}