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

int max(int a, int b) {
	int x = (a > b) ? a : b;
	return x;
}

int min(int a, int b) {
	int x = (a < b) ? a : b;
	return x;
}


int main() {
	int h, n, ans;
	bool judge = true;
	cin >> h >> n;
	vector<int> v(n - 1);

	for (int i = 0; i < n - 1; i++) cin >> v[i];

	sort(v.begin(), v.end());

	//for (int i = 0; i < n - 1; i++)cout << v[i] << endl;

	for (int i = 0; i < n - 1; i++) {
		if (h  <v[i]) {
			ans = n-(i);
			judge = false;
			break;
		}
	}

	if (judge)ans = 1;

	cout << ans;
	if (ans % 10 == 1)cout << "st" << endl;
	else if (ans % 10 == 2)cout << "nd" << endl;
	else if (ans % 10 == 3)cout << "rd" << endl;
	else cout << "th" << endl;

	return 0;
}