#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
	int a, N;
	cin >> a >> N;
	vector<int> H(N);
	H[0] = a;
	for (int i = 1; i < N; i++) {
		cin >> H[i];
	}
	sort(H.begin(), H.end());
	for (int i = 0; i < N; i++) {
		if (H[i] == a) {
			a = N - i;
			break;
		}
	}
	switch (a) {
	case 1:
		cout << "1st" << endl;
		break;
	case 2:
		cout << "2nd" << endl;
		break;
	case 3:
		cout << "3rd" << endl;
		break;
	default:
		cout << a << "th" << endl;
		break;
	}
}