#! /usr/bin/env python3
import bisect

H, N = map(int, input().split())
A = sorted([int(input()) for x in range(N-1)])
i = N - bisect.bisect_right(A, H) - 1
if i < 3:
    print(str(i+1) + ['st', 'nd', 'rd'][i])
else:
    print(str(i+1) + 'th')