#include<iostream>  
#include<cstdio>
#include<cmath> 
#include<cstring>  
#include<algorithm>  
using namespace std; 
int n,m,ans=1;
int a[1001],ll[10001],ha=1,end=1;
int main()
{ 
    freopen("translate.in","r",stdin);        
    freopen("translate.out","w",stdout);     
	cin>>m>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	ll[1]=a[1];
	for(int i=2;i<=n;i++)
	{
		int p=0;
		for(int j=end;j>=ha;j--)
		{
		    if(a[i]==ll[j])
			{
			    p=1;
				break;
			}
		}
		if(p==0)
		{
			ans+=1;
		    end+=1;
			ll[end]=a[i];
			if(end-ha>=m)ha+=1;
		}
	}
	cout<<ans;
    return 0;  
}