#include <iostream>
#include <algorithm>
#include <array>
using namespace std;
int main(){
int HiN,Nu;
cin>>HiN>>Nu;
Nu--;
int* NuO=new int[Nu];
int x=0,y=0;
while(x<Nu){
	cin>>NuO[x];
	x++;
}
sort(NuO,NuO+Nu,greater<int>());
x=0;
while(x==0){
	if(NuO[y]<=HiN){
		x++;
	}else{
		y++;
		if(y==Nu){
			x++;
		}
	}
}
y++;
switch(y%10){
	case 1: cout<<y<<"st"<<endl;  break;
	case 2: cout<<y<<"nd"<<endl;  break;
	case 3: cout<<y<<"rd"<<endl;  break;
	default: cout<<y<<"th"<<endl; break;
}
return 0;
}