#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
int n,m,a[10001],num,k=0,t=1,i,j;
int main(){
	cin>>m>>n;
	for(i=1;i<=n;i++){
		cin>>num;
		for(j=1;j<=m;j++){
			if(num==a[j])break;
		}
		if(j>m){
			k++;
			a[t++]=num;
			if(t>m)t=1;
		}
	}
	cout<<k<<endl;
	return 0;
}