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

int main() {
    int h,n;
    cin >> h >> n;
    vector<int> hs(n);
    for(int i = 0;i < n-1;i++){
        cin >> hs[i];
    }
    sort(hs.rbegin(), hs.rend());
    int count = 1;
    for(int i = 0;i < n-1;i++){
        if(h < hs[i])count++;
    }
    if(count % 10 == 1) cout << count << "st";
    else if(count %10 == 2) cout << count << "nd";
    else if(count %10 == 3) cout << count << "rd";
    else cout << count << "th";
    return 0;
}