#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
#include <iomanip>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str(); }
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const int MOD = 1000000007;

int main() {
	int H, N;
	cin >> H >> N;
	vi hi(N);
	REP(i, N-1) {
		cin >> hi[i];
	}
	hi[N - 1] = H;
	sort(RALL(hi));

	REP(i, N) {
		if (hi[i] == H) {
			if ((i+1) % 10 == 1) {
				cout << (i + 1) << "st" << endl;
			}
			else if ((i+1) % 10 == 2) {
				cout << (i + 1) << "nd" << endl;
			}
			else if ((i+1) % 10 == 3) {
				cout << (i + 1) << "rd" << endl;
			}
			else {
				cout << (i + 1) << "th" << endl;
			}
		}
	}

	return 0;
}