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

#include <iostream>
#include <string>
using namespace std;

int main()
{
	int n; // number of names
	int c; // count

	cin >> n;
	cin >> c;

	string * names = new string[n];
	bool * gone = new bool[n];

	for (int i = 0; i < n; i++)
	{
		gone[i] = false;
		cin >> names[i];
	}

	int number_gone = 0;
	int index = -1;

	while (number_gone < n)
	{
		int counter = c;
		while (counter > 0)
		{
			index = index + 1;
			index = index % n;

			if (gone[index] == false)
			{
				counter = counter - 1;
			}
		}

		gone[index] = true;
		number_gone = number_gone + 1;
		if (number_gone == n)
		{
			cout << names[index];
		}
	}
  return 1;
}