【CodeForces

C - Dasha and friends

Running with barriers on the circle track is very popular in the country where Dasha lives, so no wonder that on her way to classes she saw the following situation:

The track is the circle with length L, in distinct points of which there are nbarriers. Athlete always run the track in counterclockwise direction if you look on him from above. All barriers are located at integer distance from each other along the track.

Her friends the parrot Kefa and the leopard Sasha participated in competitions and each of them ran one lap. Each of the friends started from some integral point on the track. Both friends wrote the distance from their start along the track to each of the n barriers. Thus, each of them wrote n integers in the ascending order, each of them was between 0 and L - 1, inclusively.

 Consider an example. Let L = 8, blue points are barriers, and green points are Kefa's start (A) and Sasha's start (B). Then Kefa writes down the sequence [2, 4, 6], and Sasha writes down [1, 5, 7].

There are several tracks in the country, all of them have same length and same number of barriers, but the positions of the barriers can differ among different tracks. Now Dasha is interested if it is possible that Kefa and Sasha ran the same track or they participated on different tracks.

Write the program which will check that Kefa's and Sasha's tracks coincide (it means that one can be obtained from the other by changing the start position). Note that they always run the track in one direction — counterclockwise, if you look on a track from above.

Input

The first line contains two integers n and L (1 ≤ n ≤ 50, n ≤ L ≤ 100) — the number of barriers on a track and its length.

The second line contains n distinct integers in the ascending order — the distance from Kefa's start to each barrier in the order of its appearance. All integers are in the range from 0 to L - 1 inclusively.

The second line contains n distinct integers in the ascending order — the distance from Sasha's start to each barrier in the order of its overcoming. All integers are in the range from 0 to L - 1 inclusively.

Output

Print "YES" (without quotes), if Kefa and Sasha ran the coinciding tracks (it means that the position of all barriers coincides, if they start running from the same points on the track). Otherwise print "NO" (without quotes).

Example

Input

3 82 4 61 5 7

Output

YES

Input

4 92 3 5 80 1 3 6

Output

YES

Input

2 41 31 2

Output

NO

Note

The first test is analyzed in the statement.

题意：在一个长度为L的环上有n个障碍物，现在有两个人站在环上的不同位置，下面分别列出他们与各障碍物之间的距离（沿着环的逆时针方向），问两人是否在同一个圆上。

分析：只需要按逆时针方向计算出每两点之间的差值，最后进行比较是否一一对应。

代码如下：

#include <map>#include <cmath>#include <queue>#include <stack>#include <vector>#include <cstdio>#include <string>#include <cstring>#include <iostream>#include <algorithm>#define LL long longusing namespace std;const int MX = 55;const int mod = 1e9 + 7;const int INF = 2e9 + 5;int a[MX], b[MX];int c[105], d[105];int main(){    int n, l;    scanf("%d%d", &n, &l);    memset(a, 0, sizeof(a));    memset(b, 0, sizeof(b));    for(int i = 1; i <= n; i++){        scanf("%d", &a[i]);    }    for(int i = 1; i <= n; i++){        scanf("%d", &b[i]);    }    for(int i = 1; i <= n-1; i++){        c[i] = a[i+1] - a[i];    }    c[n] = l - a[n] + a[1];    for(int i = 1; i <= n-1; i++){        d[i] = b[i+1] - b[i];    }    d[n] = l - b[n] + b[1];    int flag;    for(int i = 1; i <= n; i++){        flag = 0;        for(int j = 1; j <= n; j++){            int x = j;            int y = i+j-1;            if(y > n)   y -= n;            if(c[x] != d[y]){                flag = 1;                break;            }        }        if(!flag)   break;    }    if(!flag)   printf("YES\n");    else printf("NO\n");    return 0;}