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

int nama;
int h[200];
int n;
int main() {
	cin >> h[0];
	cin >> n;
	nama = h[0];
	for (int i = 1; i <= n - 1; i++)cin >> h[i];
	sort(h, h + n);
	int ans;
	for (int i = 0; i <= n - 1; i++) {
		if (h[i] == nama) {
			ans = n - i;
			break;
		}
	}
	if (ans % 10 == 1)cout << ans << "st" << endl;
	else if (ans % 10 == 2)cout << ans << "nd" << endl;
	else if (ans % 10 == 3)cout << ans << "rd" << endl;
	else cout << ans << "th" << endl;
	return 0;
}