Codeforces 831C Jury Marks【暴力枚举】

C. Jury Marks

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one added to his score. It is known that the i-th jury member gave a_i points.

Polycarp does not remember how many points the participant had before this k marks were given, but he remembers that among the scores announced after each of the k judges rated the participant there were n (n ≤ k) values b₁, b₂, ..., b_n (it is guaranteed that all values b_j are distinct). It is possible that Polycarp remembers not all of the scores announced, i. e. n < k. Note that the initial score wasn't announced.

Your task is to determine the number of options for the score the participant could have before the judges rated the participant.

Input

The first line contains two integers k and n (1 ≤ n ≤ k ≤ 2 000) — the number of jury members and the number of scores Polycarp remembers.

The second line contains k integers a₁, a₂, ..., a_k ( - 2 000 ≤ a_i ≤ 2 000) — jury's marks in chronological order.

The third line contains n distinct integers b₁, b₂, ..., b_n ( - 4 000 000 ≤ b_j ≤ 4 000 000) — the values of points Polycarp remembers. Note that these values are not necessarily given in chronological order.

Output

Print the number of options for the score the participant could have before the judges rated the participant. If Polycarp messes something up and there is no options, print "0" (without quotes).

Examples

Input

4 1
-5 5 0 20
10

Output

3

Input

2 2
-2000 -2000
3998000 4000000

Output

1

Note

The answer for the first example is 3 because initially the participant could have  - 10, 10 or 15 points.

In the second example there is only one correct initial score equaling to 4 002 000.

题目大意：

现在有N个评委依次打分，主人公记不住自己初始的分数，但是他记得统计分数过程中的K个分值，问最开始可能有多少个初始分数。

思路：

我们首先O（n）预处理出打分的前缀和。

然后O（n）的枚举一个人，确定其初始分数为：pre=b【1】-sum【i】；

然后再暴力判一下当前分数是否能够作为一个结果即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<map>
#include<algorithm>
using namespace std;
#define ll __int64
ll a[2500];
ll b[2500];
ll sum[2500];
int main()
{
    ll n,k;
    while(~scanf("%I64d%I64d",&n,&k))
    {
        map<ll ,ll >ans;
        map<ll,ll >s;
        ll output=0;
        memset(sum,0,sizeof(sum));
        for(ll i=1;i<=n;i++)scanf("%I64d",&a[i]),sum[i]=sum[i-1]+a[i];
        n=unique(sum+1,sum+1+n)-sum-1;
        for(ll i=1;i<=n;i++)s[sum[i]]++;
        for(ll i=1;i<=k;i++)scanf("%I64d",&b[i]);
        for(ll i=1;i<=n;i++)
        {
            int flag=0;
            ll cnt=0;
            ll pre=b[1]-sum[i];
            for(ll i=1;i<=k;i++)
            {
                if(s[b[i]-pre]>0)continue;
                else
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                if(ans[pre]==0)
                output++;
                ans[pre]++;
            }
        }
        printf("%I64d\n",output);
    }
}