#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793;
const long double E = 2.71828182845904523;
const long long LLINF = 4000000009000000099;
const long long INF = 1009000099;
const long long MOD7 = 1000000007;
const long long MOD9 = 1000000009;
template <class A, class B, class C>
struct triple {
  A first;
  B second;
  C third;
  triple(A, B, C);
  triple();
};
template <class A, class B, class C>
triple<A, B, C>::triple(A a, B b, C c) {
  first = a;
  second = b;
  third = c;
}
template <class A, class B, class C>
triple<A, B, C>::triple() {}
template <class A, class B, class C>
triple<A, B, C> make_triple(A a, B b, C c) {
  triple<A, B, C> t(a, b, c);
  return t;
}
template <class A, class B, class C>
bool operator<(triple<A, B, C> a, triple<A, B, C> b) {
  if (a.first != b.first) return a.first < b.first;
  if (a.second != b.second) return a.second < b.second;
  if (a.third != b.third) return a.third < b.third;
}
template <class T>
T inline sqr(T a) {
  return a * a;
}
long long pow(long long a, long long d, long long mod) {
  if (d == 1) return a;
  long long t = pow(a, d / 2, mod);
  t = (t * t) % mod;
  if (d & 1) t = (t * a) % mod;
  return t;
}
long long pow(long long a, long long d) {
  if (d == 1) return a;
  long long t = pow(a, d / 2);
  t = (t * t);
  if (d & 1) t = (t * a);
  return t;
}
long long gcd(long long a, long long b) {
  while (a && b)
    if (a > b)
      a %= b;
    else
      b %= a;
  return a + b;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long C(long long n, long long k) {
  long long res = 1;
  for (int i = 1; i <= k; ++i) res = res * (n - k + i) / i;
  return res;
}
long long C(long long n, long long k, long long mod) {
  long long u = 1, d = 1;
  for (int i = 2; i <= n; ++i) u = (u * i) % mod;
  int x = max(k, n - k), z = min(k, n - k);
  for (int i = 2; i <= x; ++i) {
    d = (d * i) % mod;
    if (i <= z) d = (d * i) % mod;
  }
  d = pow(d, mod - 2, mod);
  long long res = (u * d) % mod;
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  int n, l;
  cin >> n >> l;
  vector<int> a(n);
  vector<int> b(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  int t1 = a[0] + l - a[n - 1], t2 = b[0] + l - b[n - 1];
  for (int i = 0; i < n - 1; ++i) a[i] = a[(i + 1) % n] - a[i];
  for (int i = 0; i < n - 1; ++i) b[i] = b[(i + 1) % n] - b[i];
  a[n - 1] = t1;
  b[n - 1] = t2;
  int f = 0;
  for (int i = 0; i < n; ++i) {
    if (a == b) f = 1;
    int t = a[0];
    for (int i = 0; i < n - 1; ++i) a[i] = a[i + 1];
    a[n - 1] = t;
  }
  if (f)
    cout << "YES";
  else
    cout << "NO";
}
