#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>


using namespace std;

#define MOD 1000000007
#define INF 2147483647
#define ll long long


int main()
{
	int res;
	int h, n;
	cin >> h >> n;
	
	vector<pair<int, int>> hi;
	
	hi.push_back(pair<int, int>(h, 0));
	for (int i = 0; i < n-1; i++) {
		int a;
		cin >> a;
		hi.push_back(pair<int, int>(a, 1));
	}
	sort(hi.begin(), hi.end(), greater<pair<int, int>>());
	for (int i = 0; i < n; i++) {
		if (hi[i].second == 0) {
			res = i + 1;
			break;
		}
	}
	cout << res;
	if (res % 10 == 1) {
		cout << "st" << endl;
	}
	else if (res % 10 == 2) {
		cout << "nd" << endl;
	}
	else if (res % 10 == 3) {
		cout << "rd" << endl;
	}
	else {
		cout << "th" << endl;
	}


	return (0);
}