#include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<deque>
using namespace std;

int main(){
	int h,n;
	cin >> h >> n;
	vector<int> a;
	a.push_back(h);
	for(int i=0;i<n-1;i++){
		int temp;
		cin >> temp;
		a.push_back(temp);
	}
	sort(a.begin(),a.end(),greater<int>());
	for(int i=0;i<n;i++){
		if(a[i]==h){
			cout << i+1;
			if(i+1==1){
				cout << "st" << endl;
				return 0;
			}else if(i+1==2){
				cout << "nd" << endl;
				return 0;
			}else if(i+1==3){
				cout << "rd" << endl;
				return 0;
			}else{
				cout << "th" << endl;
				return 0;
			}
		}
	}
	return 0;
}