#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f=fopen("grupuri.in","r");
FILE *g=fopen("grupuri.out","w");
int n,k,v[100000],nrg=0;

int bin(int p,int u){
	int register m;
	while(p<=u){
		m=p+(u-p)/2;
		if(v[m]<=x)
			p=m+1;
		else 
			u=m-1;
	}
	return u;
}

int main(void){
	int register i,j;
	
	fscanf(f,"%d %d",&k,&n);
	for(i=1;i<=n;i++){
		fscanf(f,"%d",&v[i]);
	}
	sort(v+1,v+n+1);
	fclose(f);
	
	int register nr=n,x;
	while(nr>=k){
		bin(1,n);
	}
	fprintf(g,"%d",nrg);
	fclose(f);
	return 0;
}