#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;


int main(int argc, char const *argv[]) {
  ll h, n;std::cin >> h >> n;
  vll d(n);
  re(i, n-1) std::cin >> d[i];
  d[n-1] = h;
  sort(all(d));
  reverse(all(d));
  for(int i=0;i<n;i++){
    if(d[i]==h){
      ll num = i+1;
      std::cout << num;
      if(num%10==1) std::cout << "st" << '\n';
      else if(num%10==2) std::cout << "nd" << '\n';
      else if(num%10==3) std::cout << "rd" << '\n';
      else std::cout << "th" << '\n';

    }
  }

}