#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
	int nama_tall, num;
	cin >> nama_tall >> num;
	vector<int> tall;
	tall.push_back(nama_tall);
	int tmp_tall;
	for (int i = 0; i<num-1; i++) {
		cin >> tmp_tall;
		tall.push_back(tmp_tall);
	}
	sort(tall.begin(), tall.end(), greater<int>());//降順ソート
	for (int i = 1; i <= num; i++) {
		if (tall[i - 1] == nama_tall) {
			switch (i) {
			case 1:
				cout << "1st";
				break;
			case 2:
				cout << "2nd";
				break;
			case 3:
				cout << "3rd";
				break;
			default:
				cout << i << "th";
				break;
			}
			break;
		}
	}


	return 0;
}