#include <iostream>
#include <queue>

using namespace std;

queue<int> q;
long vis[1005],n,m,ans,a;

int main()
{
	cin>>m>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a;
		if(vis[a]==true) continue;
		vis[a]=true;
		if(q.size()>=m) 
		{
			vis[q.front()]=false;
			q.pop();
		}
		q.push(a);
		ans++;
	}
	cout<<ans+1;
	return 0;
}

个人认为没错了啊