#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int H, N; cin>> H >> N;
  vector<int> h(N-1);
  FOR(i,0,N-1) cin >> h[i];
  sort(h.rbegin(), h.rend());
  int x = 1;
  FOR(i,0,N-1) {
    if(h[i] > H) x++;
  }
  if(x == 1) cout << "1st" << endl;
  else if(x == 2) cout << "2nd" << endl;
  else if(x == 3) cout << "3rd" << endl;
  else cout << x << "th" << endl;
  return 0;
}