#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int n,m,k,p;
int a[110001];
int b[110001];
struct car{
	string cn;
	string ty;
}c[110001];
void wash(){
	for(int i=1;i<=m;++i){
		if((i&1)){
			b[i]=a[(i/2+1)+m/2];
		} else{
			b[i]=a[(i/2+1)];
		}
	}
	for(int i=1;i<=m;++i){
		a[i]=b[i]; 
	}
}
int main(){
	scanf("%d%d%d%d",&n,&m,&k,&p);
	if(m<4*n){
		cout<<"Error:cards not enough";
		return 0;
	}
	for(int i=1;i<=m;++i){
		a[i]=i;
		b[i]=i;
		cin>>c[i].cn>>c[i].ty;
	}
	while(k--){
		wash(); 
	} 
	for(int i=1;i<=4*n;++i){
		if(i%n==p)
		cout<<c[a[i]].cn<<" "<<c[a[i]].ty<<endl;
	}
	return 0;
}