#include<iostream> using namespace std; int i; int main() { int n,d; cin>>n>>d; int stored[n],w[d]; for(int i=0;i<d;i++){ cin>>w[i]; } for(int i=0;i<n;i++){ stored[i]=0; } int cnt=0; int search=0; for(int i=0;i<d;i++){ int flag=0; for(int j=0;j<n;j++){ if(w[i]==stored[j]){ flag+=1; } } if(flag==0){ if(cnt==n){ for(int j=1;j<n;j++){ stored[j-1]=stored[j]; } stored[n-1]=w[i]; cnt=0; } else{ stored[cnt]=w[i]; cnt+=1; } search+=1; } } cout<<search; return 0; }