#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
using namespace std;
typedef long long LL;
typedef vector<int> VI;

int main() {
	int h, n, hn[101];
	cin >> h >> n;
	hn[0] = h;
	FOR(i, 1, n) cin >> hn[i];
	sort(hn, hn + n, greater<int>());
	int ans = 0;
	REP(i, n) if (hn[i] == h) ans = i + 1;
	if (ans % 10 == 1) {
		cout << ans << "st" << endl;
		return 0;
	}
	else if (ans % 10 == 2) {
		cout << ans << "nd" << endl;
		return 0;
	}
	else if (ans % 10 == 3) {
		cout << ans << "rd" << endl;
		return 0;
	}
	else {
		cout << ans << "th" << endl;
	}
	return 0;
}