Codeforces Round #269 (Div. 2)D（KMP）

D. MUH and Cube Walls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cubes one on top of the other. They defined multiple towers standing in a line as a wall. A wall can consist of towers of different heights.

Horace was the first to finish making his wall. He called his wall an elephant. The wall consists of w towers. The bears also finished making their wall but they didn't give it a name. Their wall consists of n towers. Horace looked at the bears' tower and wondered: in how many parts of the wall can he "see an elephant"? He can "see an elephant" on a segment of w contiguous towers if the heights of the towers on the segment match as a sequence the heights of the towers in Horace's wall. In order to see as many elephants as possible, Horace can raise and lower his wall. He even can lower the wall below the ground level (see the pictures to the samples for clarification).

Your task is to count the number of segments where Horace can "see an elephant".

Input

The first line contains two integers n and w (1 ≤ n, w ≤ 2·105) — the number of towers in the bears' and the elephant's walls correspondingly. The second line contains n integers ai (1 ≤ ai ≤ 109) — the heights of the towers in the bears' wall. The third line contains w integers bi (1 ≤ bi ≤ 109) — the heights of the towers in the elephant's wall.

Output

Print the number of segments in the bears' wall where Horace can "see an elephant".

Sample test(s)

input

13 5
2 4 5 5 4 3 2 2 2 3 3 2 1
3 4 4 3 2

output

2

Note

The picture to the left shows Horace's wall from the sample, the picture to the right shows the bears' wall. The segments where Horace can "see an elephant" are in gray.

题意：给出两个图形，问第二个图形可以再第一个图形中出现多少次，可以对第一个图形增加或减少任意数量的层数

思路：由于增加或减少的都是一整个图形的高度，所以我们并不用关心图形的具体高度，只用知道相对高度即可

            做法很简单，先将两幅图形都做一下相对高度的处理，即只考虑相邻物体的差值

            然后问题就转化为了求第二个图形在第一个图形中有多少次匹配

            用KMP改一下就可以做了，即每次找到一个匹配点以后直接把 j = f[ j ]，答案+1，继续匹配即可

            应该还可以用HASH做，类似于字符串HASH吧

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
        
          using namespace std; const int MAXN =200010; int a[MAXN]; int b[MAXN]; int f[MAXN]; void getfail(int m) { f[0]=0; f[1]=0; for(int i=1;i 
         
           n)printf("0\n"); else { if(w==1)printf("%d\n",n); else { for(int i=0;i