#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

string that(int x) {
  switch (x) {
  case 1: return "st";
  case 2: return "nd";
  case 3: return "rd";
  default: return "th";
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int h, n;
  cin >> h >> n;
  vector<int> hs(n-1);
  REP (i, n-1) cin >> hs[i];
  sort(hs.begin(), hs.end());

  int pos = hs.end() - lower_bound(hs.begin(), hs.end(), h);
  cout << (pos + 1) << that(pos + 1) << endl;
  
  return 0;
}