#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <random>
#include <cassert>
#include <cstring>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int main(void) {
    int i, h, n;
    cin >> h >> n;
    vector<int> a(n-1);
    REP (i,n-1) cin >> a[i];
    sort(a.begin(),a.end());
    int ans = n - (lower_bound(a.begin(),a.end(),h) - a.begin());
    assert(ans >= 1 && ans <= n);
    if (ans == 1) {
        puts("1st");
    }
    else if (ans == 2) {
        puts("2nd");
    }
    else if (ans == 3) {
        puts("3rd");
    }
    else {
        printf("%dth\n",ans);
    }
    return 0;
}