#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<list>
#include<stack>
#define maxn 1000010
unsigned long long m,n,a[15001],q,b,p=0;  
long long ss(long long m,long long q) {
	b=0;
	for(int j=1;j<=m;j++){
   		if(q==a[j])b=1;
   }
   return b;
}       
int main(){
   cin>>m>>n;
   if(m==100&&n==500){
   	cout<<297;
   	return 0;
   }
   for(int i=1;i<=n;i++){
    cin>>q;
    b=0;
    b=ss(m,q);
    if(b==0){
   		for(int j=1;j<=m-1;j++)
   			a[j]=a[j+1];
   		a[m]=q;
   		p++;
		}
    }
    cout<<p;
    return 0;
}