#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    ll h,n;
    ll ans=0;
    cin>>h>>n;
    vector<ll> a(n);
    for(int i=0;i<n-1;i++){
        cin>>a[i];
    }
    a[n-1]=h;
    sort(a.begin(),a.end(),greater<>());
    for(int i=0;i<n;i++){
        if(a[i]==h) ans=i+1;
    }
    if(ans<10){
    if(ans==1) cout<<ans<<"st"<<endl;
    else if(ans==2) cout<<ans<<"nd"<<endl;
    else if(ans==3) cout<<ans<<"rd"<<endl;
    else cout<<ans<<"th"<<endl;
    }
    else{
       
        if(ans%10==1) cout<<ans<<"st"<<endl;
        else if(ans%10==2) cout<<ans<<"nd"<<endl;
        else if(ans%10==3) cout<<ans<<"rd"<<endl;
        else cout<<ans<<"th"<<endl;
    }
    
    
    return 0;
}