#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <iomanip>



int main()
{
	long long h, n;

	std::cin >> h >> n;

	std::vector<long long > v(n);

	v[0] = h;
	for (size_t i = 1; i < n; i++) {
		std::cin >> v[i];
	}

	std::sort(v.begin(), v.end());
	std::reverse(v.begin(), v.end());

	auto pos = std::find(v.begin(), v.end(), h) - v.begin() + 1;

	std::cout << pos << (pos % 10 == 1 ? "st" : (pos % 10 == 2 ? "nd" : (pos % 10 == 3 ? "rd" : "th"))) << std::endl;

	return 0;
}