//简单的一个循环
#include<iostream>
#include<cstring>
#include<unordered_set>

using namespace std;

const int N=1010;

int m,n,s;

string name[N];

int main()
{
    cin>>m>>n>>s;
    for(int i=1;i<=m;i++) cin>>name[i];

    unordered_set<string> hash;
    int k=s;
    while(k<=m)
    {
        if(hash.count(name[k])) k++;
        else
        {
            cout<<name[k]<<endl;
            hash.insert(name[k]);
            k+=n;
         } 
    }
    if(hash.empty()) cout<<"Keep going..."<<endl;

    return 0;
}