// 2022 IUSB Programming Competition
// Round 2 Problem 2
// Designated Volunteer
// Solution by Liguo Yu

import java.util.Scanner;

public class round2_p2
{	
    public static void main(String[] args)
    {
    	Scanner input = new Scanner(System.in);
        
        int n = input.nextInt(); // number of names
        int c = input.nextInt(); // count
        
        String[] names = new String[n];
        boolean[] gone = new boolean[n];
        
        for(int i=0; i<n; i++)
        {
            gone[i] = false;
            names[i] = input.next();
        }
        
        int left = n;
        int index = -1;
       
        while(left > 0)
        {
            int counter = c;
            while(counter>0)
            {
                index = index+1;
                index = index%n;
                
                if(gone[index]==false)
                {
                    counter = counter - 1;
                }
            }   
            
            gone[index]=true;
            left = left - 1;
            if(left == 0)
            {
                System.out.println(names[index]);
            }
        }
    }
}