#include <cstdio>
int stack[10000],now;
int main(){int m,n;scanf("%d%d",&m,&n); int head=m;for(int i=0;i<m;i++)stack[i]=-1;for(int i=0;i<n;i++){bool flag=true;scanf("%d",&now);for(int j=head-m;j<head;j++)if(stack[j]==now){flag=false;break;}if(flag)stack[head++]=now;}printf("%d\n",head-m);return 0;
}

#include <cstdio>
int t[5],a[40000],s[5];
int f[41][41][41][41];
int main(){int m,n,in,ans=0;scanf("%d%d",&n,&m);for(int i=0;i<n;i++)scanf("%d",&a[i]);for(int i=0;i<m;i++)scanf("%d",&in),s[in]++;f[0][0][0][0]=a[0];for(int i=0;i<=s[1];i++)for(int j=0;j<=s[2];j++)for(int k=0;k<=s[3];k++)for(int l=0;l<=s[4];l++){if(f[i+1][j][k][l]<f[i][j][k][l]+a[1*i+2*j+3*k+4*l+1])f[i+1][j][k][l]=f[i][j][k][l]+a[1*i+2*j+3*k+4*l+1];if(f[i][j+1][k][l]<f[i][j][k][l]+a[1*i+2*j+3*k+4*l+2])f[i][j+1][k][l]=f[i][j][k][l]+a[1*i+2*j+3*k+4*l+2];if(f[i][j][k+1][l]<f[i][j][k][l]+a[1*i+2*j+3*k+4*l+3])f[i][j][k+1][l]=f[i][j][k][l]+a[1*i+2*j+3*k+4*l+3];if(f[i][j][k][l+1]<f[i][j][k][l]+a[1*i+2*j+3*k+4*l+4])f[i][j][k][l+1]=f[i][j][k][l]+a[1*i+2*j+3*k+4*l+4];}for(int i=0;i<=s[1];i++)for(int j=0;j<=s[2];j++)for(int k=0;k<=s[3];k++)for(int l=0;l<=s[4];l++){if(f[i][j][k][l]>ans&&(i+2*j+3*k+4*l+1==n))ans=f[i][j][k][l];}printf("%d\n",ans);return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;
int f[20005],r[20005];
struct seg{int a,b,l;friend bool operator <(const seg&a,const seg&b){return a.l>b.l;}
}s[100005];
int sf(int x){if (f[x]==x) return x;int fx=sf(f[x]);r[x]=(r[x]+r[f[x]])%2;return f[x]=fx;
}
void Union(int x,int y,int fx,int fy,int d)
{f[fy]=fx;r[fy]=(2-r[y]+d+r[x])%2;
}
int main(){int m,n;scanf("%d%d",&n,&m);for(int i=0;i<m;i++)scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].l);sort(s,s+m);for(int i=1;i<=n;i++)f[i]=i;for(int i=0;i<m;i++){int fa=sf(s[i].a),fb=sf(s[i].b);if(fa==fb){if(r[s[i].a]==r[s[i].b]){printf("%d",s[i].l);return 0;}}else Union(s[i].a,s[i].b,fa,fb,1);}puts("0");return 0;
}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int map[505][505],m,n;
int b[505][505];
struct seg{int a,b;}s[505];
bool cmp(seg x,seg y){if(x.a==y.a)return x.b>y.b;return x.a<y.a;
}
void floodfill(int x,int y){b[x][y]=1;if(x+1<=n&&map[x+1][y]<map[x][y]&&!b[x+1][y])floodfill(x+1,y); if(x-1>0&&map[x-1][y]<map[x][y]&&!b[x-1][y])floodfill(x-1,y);if(y+1<=m&&map[x][y+1]<map[x][y]&&!b[x][y+1])floodfill(x,y+1);if(y-1>0&&map[x][y-1]<map[x][y]&&!b[x][y-1])floodfill(x,y-1);
}
int main(){freopen("flow.in","r",stdin);freopen("flow.out","w",stdout);int i,j,top=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i++)for(j=1;j<=m;j++)scanf("%d",&map[i][j]);for(i=1;i<=m;i++)if(map[1][i]>=map[1][i+1]&&map[1][i]>=map[1][i-1]){memset(b,0,sizeof b);floodfill(1,i);for(j=1;j<=m;j++)if(b[n][j]){s[top].a=j;break;}if(s[top].a==0)continue;for(j=s[top].a;;j++)if(!b[n][j]){s[top++].b=j-1;break;}}sort(s,s+top,cmp);int l=s[0].a,r=s[0].b,tmp=1;for(j=1;j<top;j++)if((s[j].a-1)<=r&&s[j].b>r){r=s[j].b;tmp++;}if(r==m&&l==1){puts("1");printf("%d\n",tmp);}else{int tmp=0; for(i=1;i<=m;i++)if(map[1][i]>=map[1][i+1]&&map[1][i]>=map[1][i-1])floodfill(1,i);for(j=1;j<=m;j++)if(!b[n][j])tmp++;puts("0");printf("%d\n",tmp); }return 0;fclose(stdin);fclose(stdout);
}

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int map[505][505],m,n;
int b[505][505];
struct seg{int a,b;}s[505];
bool cmp(seg x,seg y){if(x.a==y.a)return x.b>y.b;return x.a<y.a;
}
void floodfill(int x,int y){b[x][y]=1;if(x+1<=n&&map[x+1][y]<map[x][y]&&!b[x+1][y])floodfill(x+1,y); if(x-1>0&&map[x-1][y]<map[x][y]&&!b[x-1][y])floodfill(x-1,y);if(y+1<=m&&map[x][y+1]<map[x][y]&&!b[x][y+1])floodfill(x,y+1);if(y-1>0&&map[x][y-1]<map[x][y]&&!b[x][y-1])floodfill(x,y-1);
}
int main(){int i,j,top=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i++)for(j=1;j<=m;j++)scanf("%d",&map[i][j]);for(i=1;i<=m;i++)if(map[1][i]>=map[1][i+1]&&map[1][i]>=map[1][i-1]){memset(b,0,sizeof b);floodfill(1,i);for(j=1;j<=m;j++)if(b[n][j]){s[top].a=j;break;}if(s[top].a==0)continue;for(j=s[top].a;;j++)if(!b[n][j]){s[top++].b=j-1;break;}}sort(s,s+top,cmp);int l=1,r=0,tmp=0; bool flag;do{int max=0; flag=1; for(int i=0;i<top;i++)if(s[i].a-1<=r&&s[i].b>r){if(s[i].b>max)max=s[i].b;flag=0;}r=max; tmp++;}while(r!=m&&!flag);if(r==m){puts("1");printf("%d\n",tmp);}else{int tmp=0; for(i=1;i<=m;i++)if(map[1][i]>=map[1][i+1]&&map[1][i]>=map[1][i-1])floodfill(1,i);for(j=1;j<=m;j++)if(!b[n][j])tmp++;puts("0");printf("%d\n",tmp); }return 0;
}