//No.564 背の順

#include <iostream>
#include <algorithm>
using namespace std;

namespace
{
int H[ 110 ];
}

int main()
{
int i;
int iNama;
int N;
int iCount;

	cin >> iNama;
	cin >> N;
	for( i = 0; i < N - 1; i++ )
		cin >> H[ i ];

	sort( H, H + ( N - 1 ) );

	for( i = 0; i < N - 1; i++ )
	{
		if( iNama < H[ i ] ) break;
	}

	iCount = N - i;

	i = iCount % 10;
	if( i == 3 )
		cout << iCount << "rd" << endl;
	else if( i == 2 )
		cout << iCount << "nd" << endl;
	else if( i == 1 )
		cout << iCount << "st" << endl;
	else
		cout << iCount << "th" << endl;

	return 0;
}