buckets, numbersCount = list(map(int, input().split()))
ans = -1
numbers = []
hashes = []
for _ in range(numbersCount):
numbers.append(int(input()))
counter = 0
for number in numbers:
mod = number % buckets
if not mod in hashes:
hashes.append(mod)
else:
ans = counter + 1
break
counter += 1
print(ans)
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int p,n;
cin>>p>>n;
long long int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
long long int ans=-1;
// set<int>s;
vector<long long int>v;
for(int i=0;i<n;i++){
long long int mes=arr[i]%p;
vector<long long int>::iterator it;
it=find(v.begin(),v.end(),mes);
if(it==v.end()){
v.push_back(mes);
}
else{
ans=i+1;
break;
}
}
cout<<ans<<endl;
return 0;
}
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |
1665D - GCD Guess | 29A - Spit Problem |
1097B - Petr and a Combination Lock | 92A - Chips |
1665B - Array Cloning Technique | 1665A - GCD vs LCM |
118D - Caesar's Legions | 1598A - Computer Game |
1605A - AM Deviation | 1461A - String Generation |
1585B - Array Eversion | 1661C - Water the Trees |
1459A - Red-Blue Shuffle | 1661B - Getting Zero |
1661A - Array Balancing | 1649B - Game of Ball Passing |
572A - Arrays | 1455A - Strange Functions |
1566B - MIN-MEX Cut | 678C - Joty and Chocolate |