import java.util.Comparator;
import java.util.LinkedList;
import java.util.Scanner;
public class Main{
	private static Scanner sc=new Scanner(System.in);
	public static void main(String args[])throws Exception{
		int height=sc.nextInt(),n=sc.nextInt();
		LinkedList<Integer>queue=new LinkedList<Integer>();
		queue.offer(height);
		for(int i=0;i<n-1;i++)queue.offer(sc.nextInt());
		queue.sort(Comparator.reverseOrder());
		int counter=0;
		for(int i=0;i<queue.size();i++){
			if(queue.get(i)==height){
				counter=i+1;
				break;
			}
		}String s=String.valueOf(counter);
		switch(counter%10){
		case 1:s+="st";break;
		case 2:s+="nd";break;
		case 3:s+="rd";break;
		default:s+="th";break;
		}System.out.println(s);
	}
}