#include <iostream> #include <stdio.h> #include <string> #include <list> #include <vector> #include <algorithm> #define rep(i,n) for(int i = 0;i < n;i++) #define REP(i,n,k) for(int i = n;i < k;i++) #define P(p) cout << (p) << endl;//print typedef long long ll; using namespace std; int main(){ cin.tie(0); ios::sync_with_stdio(false); int n; int a; cin >> a >> n; vector<int> h; rep(i,n-1){ int tmp; cin >> tmp; h.push_back(tmp); } sort(h.begin(),h.end(),greater<int>()); int ans=0; while(true){ if(h[ans]<a){ break; } ans++; } ans++; int aa = ans% 10; if(aa==1){ cout << ans << "st" << endl; }else if(aa==2){ cout << ans << "nd" << endl; }else if(aa==3){ cout << ans << "rd" << endl; }else{ cout << ans << "th" << endl; } }