#include <bits/stdc++.h>
using namespace std;
#define ll long long

void Warding()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
vector<ll> v1, v2;
ll n, k;

int rec(ll t, int idx);

void solve()
{
    cin >> n >> k;
    v1.resize(n);
    v2.resize(n);
    for (auto &i : v1)
        cin >> i;
    for (auto &i : v2)
        cin >> i;
    int test = max(rec(v1[0], 0), rec(v2[0], 0));
    cout << (test == n ? "Yes" : "No") << endl;
}

int main()
{
    Warding();
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

int rec(ll t, int idx)
{
    if (idx == n - 1)
        return 1;
    else if (abs(t - v1[idx + 1]) <= k and abs(t - v2[idx + 1]) <= k)
    {
        return 1 + max(rec(v1[idx + 1], idx + 1), rec(v2[idx + 1], idx + 1));
    }
    else if (abs(t - v1[idx + 1]) <= k)
        return 1 + rec(v1[idx + 1], idx + 1);
    else if (abs(t - v2[idx + 1]) <= k)
        return 1 + rec(v2[idx + 1], idx + 1);
    else
        return 0;
}