#include #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 using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} template void print_tate(vector &v) {rep(i,v.size()) cout<>N>>L; ll d[N*2]; vector B(N*2); ll P[N*2]={0}; rep(i,N) cin>>d[i]; rep(i,N*2) 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<=0&&B[0]%L==0); }