#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const int inf = 1e9 + 7;

int A,N;
int H[110];
int main() {
	cin>>H[0]>>N;
	A=H[0];
	REP(i,1,N){
		cin>>H[i];
	}
	
	sort(H,H+N);
	int ans = H+N-lower_bound(H,H+N,A);
	if(ans%10==1) cout<<ans<<"st"<<endl;
	else if(ans%10==2) cout<<ans<<"nd"<<endl;
	else if(ans%10==3) cout<<ans<<"rd"<<endl;
	else cout<<ans<<"th"<<endl;
	return 0;
}