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

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

int main()
{
	int h, n,ans=0;
	cin >> h >> n;

	rep(i, n-1) {
		int H;
		cin >> H;
		if (H < h)ans++;
	}
	
	string str;
	if (((n - ans) % 10) % 10 == 1)str = "st";
	else if (((n - ans) % 10) % 10 == 2)str = "nd";
	else if (((n - ans) % 10) % 10 == 3)str = "rd";
	else str = "th";

	cout << n - ans << str << endl;
	return	0;
}