#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  int h, n;
  cin >> h >> n;
  vector<int> v(n);
  v[0]=h;

  for (int i=1; i<n; i++) {
    cin >> v[i];
  }

  sort(v.begin(), v.end(), greater<int>());

  for (int i=0; i<n; i++) {
    if (v[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;
    }
  }
  return 0;
}