#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))

#define MOD 1000000007
#define INF 1000000000

int H, N;
vector<int> height;

int main()
{
    cin >> H >> N;
    height.push_back(H);
    REP(i, N-1) {
        int tmp;
        cin >> tmp;
        height.push_back(tmp);
    }
    sort(height.begin(), height.end(), greater<int>());
    int num;
    for(num = 1; num <= N; ++num) {
        //printf("height[%d]: %d\n", num-1, height[num-1]);
        if(height[num-1] == H) { break; }
    }
    printf("%d", num);
    if(num % 10 == 1) { printf("st\n"); }
    else if(num % 10 == 2) { printf("nd\n"); }
    else if(num  % 10 == 3) { printf("rd\n"); }
    else { printf("th\n"); }
    return 0;
}