#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
    ll h,n;
    cin >> h >> n;
    vector<ll> a(n);
    for(int i = 1;i < n;i++)cin >> a[i];
    a[0] = h;
    sort(a.rbegin(),a.rend());
    ll rn = 0;
    for(int i = 0;i < n;i++){
        if(a[i] == h)rn = i + 1;
    }
    
    cout << rn;
    if(rn % 10 == 1)cout << "st" << endl;
    else if(rn % 10 == 2)cout << "nd" << endl;
    else if(rn % 10 == 3)cout << "rd" << endl;
    else cout << "th" << endl;
}