#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int m;
int n;
vector<int> v;
cin>>m>>n;
int a;
int count=0;
for(int i=0;i<n;i++){
cin>>a;
if(find(v.begin(),v.end(),a)==v.end()){
count++;
if(v.size()<m) v.push_back(a);
else {
v.erase(v.begin());
v.push_back(a);
}
}
}
cout<<count;
}
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int m;
int n;
vector<int> v;
cin>>m>>n;
int a;
int count=0;
for(int i=0;i<n;i++){
cin>>a;
if(find(v.begin(),v.end(),a)==v.end()){
count++;
if(v.size()<m) v.push_back(a);
else {
v.erase(v.begin());
v.push_back(a);
}
}
}
cout<<count;
}

京公网安备 11010502036488号