#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <string>

using namespace std;

void solve();

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}

void solve() {
    int H,n;
    cin >> H >> n;
    int h[n];
    for(int i = 0; i < n-1; i++) {
        cin >> h[i];
    }
    vector<pair<int,int> > v;
    v.push_back(make_pair(H,0));
    for(int i = 0; i < n-1; i++) {
        v.push_back(make_pair(h[i],1));
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < n; i++) {
        if(v.at(i).second == 0) {
            int tmp = n - i;
            cout << tmp;
            if(tmp % 10 == 1) cout << "st";
            else if(tmp % 10 == 2) cout << "nd";
            else if(tmp % 10 == 3) cout << "rd";
            else cout << "th";
            cout << endl;
            break;
        }
    }

    
}