Codeforces Round #FF (Div. 2)A. DZY Loves Hash

A. DZY Loves Hash

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

DZY has a hash table with p buckets, numbered from 0 to p - 1. He wants to insert n numbers, in the order they are given, into the hash table. For the i-th number xi, DZY will put it into the bucket numbered h(xi), where h(x) is the hash function. In this problem we will assume, that h(x) = x mod p. Operation a mod b denotes taking a remainder after division a by b.

However, each bucket can contain no more than one element. If DZY wants to insert an number into a bucket which is already filled, we say a "conflict" happens. Suppose the first conflict happens right after the i-th insertion, you should output i. If no conflict happens, just output -1.

Input

The first line contains two integers, p and n (2 ≤ p, n ≤ 300). Then n lines follow. The i-th of them contains an integer xi (0 ≤ xi ≤ 109).

Output

Output a single integer — the answer to the problem.

Sample test(s)

input

10 5
0
21
53
41
53

output

4

input

5 5
0
1
2
3
4

output

-1

水题直接粘代码

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[333];
int fin(int x,int n)
{
    for(int i=1;i<n;i++)
    {
        if(x==a[i])
            return 1;
    }
    return 0;
}
int main()
{
    int p,n,x;
    int vis=1;
    int ans=-1;
    cin>>p>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        x=x%p;
        if(vis&&fin(x,i))
        {
            ans=i;
            vis=0;
        }
        a[i]=x;
    }

    cout<<ans<<endl;
    return 0;
}