#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 2000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define rsort(x) sort(all(x));reverse(all(x))
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

bool debug=false;
/*---------------------------------------------------*/

int main(){
  int n,h,H;
  vi rank;
  cin>>H>>n;
  rank.pb(H);
  rep(i,n-1){cin>>h;rank.pb(h);}
  rsort(rank);
  rep(i,n)
    if(rank[i]==H){
      if((i+1)%10==1)cout<<i+1<<"st"<<endl;
      else if((i+1)%10==2)cout<<i+1<<"nd"<<endl;
      else if((i+1)%10==3)cout<<i+1<<"rd"<<endl;
      else cout<<i+1<<"th"<<endl;
    }
  return 0;
}