#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, l; cin >> n >> l;
  vector<int> d(n * 2); REP(i, n) cin >> d[i];
  FOR(i, n, n * 2) d[i] = l + d[i - n];
  vector<int> b(n * 2); REP(i, n * 2) cin >> b[i];
  vector<ll> f(n * 2);
  REP(i, n * 2) {
    int d_j = (i + 1 == n * 2 ? d[0] + l * 2 : d[i + 1]);
    if ((b[(i + 1) % (n * 2)] - b[i]) % (d_j - d[i]) > 0) {
      cout << "No\n";
      return 0;
    }
    f[i] = (b[(i + 1) % (n * 2)] - b[i]) / (d_j - d[i]);
  }
  vector<ll> g(n * 2);
  REP(i, n * 2) {
    if ((f[i] - f[(i - 1 + n * 2) % (n * 2)]) % 2 > 0) {
      cout << "No\n";
      return 0;
    }
    g[i] = (f[i] - f[(i - 1 + n * 2) % (n * 2)]) / 2;
  }
  // REP(i, n * 2) cout << g[i] << " \n"[i + 1 == n * 2];
  vector<ll> h(n * 2, 0);
  REP(i, n) {
    if (g[i] + g[n + i] != 0) {
      cout << "No\n";
      return 0;
    }
    if (g[i] > 0) {
      REP(j, n) h[i + j] += g[i] * (d[i + j] - d[i]);
      h[i + n] += g[i] * l;
      REP(j, n) h[(i - j + n * 2) % (n * 2)] += g[i] * (d[i] - (i - j < 0 ? d[(i - j + n * 2) % (n * 2)] - l * 2 : d[i - j]));
    } else if (g[i] < 0) {
      REP(j, n) h[i + n - j] += -g[i] * (d[i + n] - d[i + n - j]);
      h[i] += -g[i] * l;
      REP(j, n) h[(i + n + j) % (n * 2)] += -g[i] * ((i + n + j >= n * 2 ? d[(i + n + j) % (n * 2)] + l * 2 : d[i + n + j]) - d[i + n]);
    }
  }
  // REP(i, n * 2) cout << h[i] << " \n"[i + 1 == n * 2];
  if (b[0] - h[0] < 0 || (b[0] - h[0]) % l > 0) {
    cout << "No\n";
    return 0;
  }
  FOR(i, 1, n * 2) {
    if (b[i] - h[i] != b[0] - h[0]) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}