#include "bits/stdc++.h"
#define rep(a,b) for(int a = 0;a < b;a++)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define P(a) cout << a << endl
#define MP(a,b) make_pair(a,b)
#define PB(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int dx[] = { 1, -1 , 0 , 0 };
int dy[] = { 0,  0,  1, -1 };
ll MOD = 1000000007;

void solve() {
    int h,n;
    cin >> h >> n;
    vi v;
    v.PB(h);
    rep(i,n-1){
        int a;
        cin >> a;
        v.PB(a);
    }
    sort(v.begin(),v.end());
    reverse(v.begin(),v.end());
    rep(i,v.size()){
        if(v[i] == h){
            string num = to_string(i+1);
            int last = num[num.length()-1]-'0';
            if(last == 1){
                P(num+"st");
            }else if(last == 2){
                P(num+"nd");
            }else if(last == 3){
                P(num+"rd");
            }else{
                P(num+"th");
            }
        }
    }
}

int main() {
    solve();
    return 0;
}