1
//666小数据直接哈希加速，避免了遍历
2
#include <bits/stdc++.h>
3
using namespace std;
4
typedef long long ll;
5
queue<ll> qq;
6
vector<ll> hh(1010,0);
7
int main(){
8
    ll m,n;
9
    cin>>m>>n;
10
    ll cnt=0;
11
    for(ll i=0;i<n;i++){
12
        ll t;
13
        cin>>t;
14
        if(!hh[t]){
15
            hh[t]=1;
16
            qq.push(t);
17
            cnt++;
18
            while(qq.size()>m){
19
                hh[qq.front()]=0;
20
                qq.pop();
21
            }
22
        }
23
    }
24
    cout<<cnt<<endl;
25
    return 0;
26
}