#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
using namespace std;

int main(void) {
	int x, h, n;
	cin >> h >> n;
	vector <int> v(n - 1);
	for (int i = 0; i < n - 1; i++) {
		cin >> v[i];
	}
	v.push_back(h);
	sort(v.begin(), v.end());
	reverse(v.begin(),v.end());
	for (int i = 0; i < n; i++) {
		if (v[i] == h) {
			switch (i)
			{
			case 0:
				cout << "1st" << endl;
				break;
			case 1:
				cout << "2nd" << endl;
				break;
			case 2:
				cout << "3rd" << endl;
				break;
			default:
				cout << i + 1 << "th" << endl;
				break;
			}
			return 0;
		}
	}
	return 0;
}