#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF INT_MAX/3

ll h,n;
ll a[101010];

int main(){
	cin.sync_with_stdio(false);
  cin>>h>>n;
  rep(i,n-1)cin>>a[i];
  a[n-1]=h;
  sort(a,a+n);
  ll idx=lower_bound(a,a+n,h)-a;
  idx=n-idx;
  string res=to_string(idx);
  if(res[res.size()-1]=='1')cout<<res+"st"<<endl;
  else if(res[res.size()-1]=='2')cout<<res+"nd"<<endl;
  else if(res[res.size()-1]=='3')cout<<res+"rd"<<endl;
  else cout<<res+"th"<<endl;
	return 0;
}