#include<iostream>
#include<algorithm>

using namespace std;

int main(){
  int nama, n;
  cin >> nama >> n;
  int h[n-1];
  for(int i=0; i<n-1; i++){
    cin >> h[i];
  }
  sort(h, h+n-1);

  int count=1;
  for(int i=n-2; h[i]>nama; i--){
    count++;
  }
  if(count%10==1){
    cout << count << "st" << endl;
  }else if(count%10==2){
    cout << count << "nd" << endl;
  }else if(count%10==3){
    cout << count << "rd" << endl;
  }else{
    cout << count << "th" << endl;
  }
  return 0;
}