//WA #include using namespace std; const long long INF = 100000000000000000; int main(){ int N, L; cin >> N >> L; vector d(N); for (int i = 0; i < N; i++){ cin >> d[i]; } vector B(N * 2); for (int i = 0; i < N * 2; i++){ cin >> B[i]; } vector p(N * 2); for (int i = 0; i < N; i++){ p[i] = d[i]; p[N + i] = L + d[i]; } vector> s(N * 2, vector(N * 2, 0)); for (int i = 0; i < N * 2; i++){ for (int j = 0; j < N * 2; j++){ s[i][j] = min(abs(p[j] - p[i]), L * 2 - abs(p[j] - p[i])); } } long long sum1 = 0; for (int i = 0; i < N * 2; i++){ sum1 += s[0][i]; } long long sum2 = 0; for (int i = 0; i < N * 2; i++){ sum2 += B[i]; } if (sum2 % sum1 != 0){ cout << "No" << endl; } else { long long c = sum2 / sum1; bool ok = true; vector s(N); for (int i = 0; i < N; i++){ int j = i + 1; long long d1 = B[j] - B[i]; long long d2 = p[j] - p[i]; if (d1 % d2 != 0){ ok = false; } else if (abs(d1) / d2 % 2 != c % 2){ ok = false; } else { s[i] = (c - d1 / d2) / 2; } } if (!ok){ cout << "No" << endl; } else { cout << "Yes" << endl; } } }