#include <stdio.h>
#include <stdlib.h>

int cmp(const void* n1, const void* n2)
{
	if (*(int*)n1 > *(int*)n2) {
		return -1;
	}
	else if (*(int*)n1 < *(int*)n2) {
		return 1;
	}

	return 0;
}


int main()
{
	int h1, N, ans = 0;
	int* H;

	if (scanf("%d %d", &h1, &N) != 2) {
		return -1;
	}

	H = (int*)malloc(sizeof(int) * N);

	if (H == NULL) {
		return -1;
	}

	*(H + 0) = h1;

	for (int i = 1; i < N; i++) {
		if (scanf("%d", &*(H + i)) != 1) {
			return -1;
		}
	}

	qsort(H, N, sizeof(int), cmp);

	for (int i = 0; i < N; i++) {
		if (*(H + i) == h1) {
			ans = i + 1;
			break;
		}
	}

	switch (ans % 10)
	{
	case 1:
		printf("%dst", ans);
		break;
	case 2:
		printf("%dnd", ans);
		break;
	case 3:
		printf("%drd", ans);
		break;
	default:
		printf("%dth", ans);
		break;
	}

	free(H);
	H = NULL;

	return 0;
}