#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
using namespace std;
typedef long long int lont;
int main() {
	int H, N;
	cin >> H >> N;
	vector<int>vec(N-1);
	for (int ia = 0; ia < N-1; ia++) {
		cin >> vec.at(ia);
	}
	sort(vec.begin(), vec.end());
	reverse(vec.begin(), vec.end());
	int A;
	for (int ib = 0; ib < N - 1; ib++) {
		if (H > vec.at(ib)) {
			A = ib+1;
			break;
		}
		A = ib + 2;
	}
	string B;
	if (A % 10 == 1)B = "st";
	else if (A % 10 == 2)B = "nd";
	else if (A % 10 == 3)B = "rd";
	else B = "th";
	cout << A << B << endl;
}