B. Dasha and friends

B. Dasha and friends

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 n barriers. 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).

Examples

input

3 8
2 4 6
1 5 7

output

YES

input

4 9
2 3 5 8
0 1 3 6

output

YES

input

2 4
1 3
1 2

output

NO

Note

The first test is analyzed in the statement.

这个题转换一下思路就可以了。

不要想起点在哪，而是计算出每个障碍之间的间隔是多少。

然后求出的两个间隔队列比较一下，注意这里的比较不要忘记位移比较，因为是个圈。所以如果在某个位移位置存在重合，那么就是相等的，否则就是不相等。

#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
using namespace std;
const int MAXN=55;
const int inf =1e9;
int n,m;
int a[MAXN],b[MAXN];
int ans1[MAXN],ans2[MAXN];
int main()
{
    int i,j;
    scanf("%d%d",&n,&m);

    for(i=0; i<n; ++i)
    {
        scanf("%d",&a[i]);
    }
    for(i=1; i<n; ++i)ans1[i]=a[i]-a[i-1];
    ans1[0]=a[0]+m-a[n-1];
    for(i=0; i<n; ++i)
    {
        scanf("%d",&b[i]);
    }
    for(i=1; i<n; ++i)ans2[i]=b[i]-b[i-1];
    ans2[0]=b[0]+m-b[n-1];

    int flag=0;
    for(i=0; i<n; ++i)
    {
        for(j=0; j<n; ++j)
        {
            if(ans1[j]!=ans2[(i+j)%n])break;
        }
        if(j==n)
        {
            flag=1;
            break;
        }
    }
    if(flag)puts("YES");
    else puts("NO");
    return 0;
}