#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int inf = 1000000000;

int main(void) {

  int m, n;
  cin >> m >> n;
  vector<int> h(n-1);
  for(int i=0; i<n-1; i++) cin >> h[i];
  sort(h.begin(), h.end());
  reverse(h.begin(), h.end());
  h.push_back(-1);
  for(int i=0; i<n; i++){
    if( m > h[i] ){
      cout << i+1;
      if( i % 10 == 0 ) cout << "st" << endl;
      else if( i % 10 == 1 ) cout << "nd" << endl;
      else if( i % 10 == 2 ) cout << "rd" << endl;
      else cout << "th" << endl;
      return 0;
    }
  }

  return 0;
}

// EOF