F. Summer Practice Report

time limit per test

 seconds

memory limit per test

 megabytes

input

standard input

output

standard output

Vova has taken his summer practice this year and now he should write a report on how it went.

Vova has already drawn all the tables and wrote down all the formulas. Moreover, he has already decided that the report will consist of exactly n

pages and the i-th page will include xi tables and yi formulas. The pages are numbered from  to n

.

Vova fills the pages one after another, he can't go filling page i+1

before finishing page i

and he can't skip pages.

However, if he draws strictly more than k

tables in a row or writes strictly more than k

formulas in a row then he will get bored. Vova wants to rearrange tables and formulas in each page in such a way that he doesn't get bored in the process. Vova can't move some table or some formula to another page.

Note that the count doesn't reset on the start of the new page. For example, if the page ends with 3

tables and the next page starts with  tables, then it's counted as 8

tables in a row.

Help Vova to determine if he can rearrange tables and formulas on each page in such a way that there is no more than k

tables in a row and no more than k

formulas in a row.

Input

The first line contains two integers n

and k (≤n≤⋅, ≤k≤

).

The second line contains n

integers x1,x2,…,xn (≤xi≤) — the number of tables on the i

-th page.

The third line contains n

integers y1,y2,…,yn (≤yi≤) — the number of formulas on the i

-th page.

Output

Print "YES" if Vova can rearrange tables and formulas on each page in such a way that there is no more than k

tables in a row and no more than k

formulas in a row.

Otherwise print "NO".

Examples

Input

Copy

Output

Copy

YES

Input

Copy

Output

Copy

NO

Input

Copy

Output

Copy

YES

Note

In the first example the only option to rearrange everything is the following (let table be 'T' and formula be 'F'):

    page 

: "TTFTTFT"

page 

    : "TFTTFTT" 

That way all blocks of tables have length 

.

In the second example there is no way to fit everything in such a way that there are no more than

tables in a row and  formulas in a row.

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAX_N = 3e5 + ;

int N, K;

//-1为不可能，其他为剩余的flag（0x，1y）的值。

bool ans;

ll judge(int flag, ll x, ll y)

{//y开始，剩y

    if(!flag)

        swap(x, y);

    ll l = y/K + (y%K > );

    ll r = K*y + K;

    if (l <= x && x <= r)

        return ;

    ll tmp = y - K*x;

    return tmp;

}

ll f[MAX_N][];//0:x, 1:y

ll x[MAX_N], y[MAX_N];

int main()

{

    cin >> N >> K;

    ans = true;

    for (int i = ; i <= N; i++)

        scanf("%lld", x+i);

    for (int i = ; i <= N; i++)

        scanf("%lld", y+i);

    f[][] = f[][] = ;

    for (int i = ; i <= N; i++) {

        f[i][] = judge(, x[i]+f[i-][], y[i]);

        f[i][] = judge(, x[i], y[i]+f[i-][]);

        if (f[i][] > K || f[i][] > K) {

            ans = false;

            break;

        }

    }

    if (ans)

        puts("YES");

    else

        puts("NO");

    return ;

}