#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
typedef vector<ll> vec;
typedef vector<vec> mat;

const int inf = (int)1e9; 

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

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