#include<bits/stdc++.h>
#ifdef ONLINE_JUDGE
#include "books.h"
#endif
using namespace std;
#ifndef ONLINE_JUDGE
void impossible(){
	puts("impossible");
	return;
}
long long skim(int x){
	cout<<"skim "<<x<<endl;
	long long aa;
	cin>>aa;
	return aa;
}
void answer(auto au){
	for(auto cu:au)printf("%d ",cu);
	printf("\n");
	return;
}
#endif
void solve(int n,int k,long long a,int s){
	if(n<k){
		impossible();
		return;
	}
	int L=1,R=n;
	while(L<=R){
		int mid=(L+R)>>1;
		long long df=skim(mid);
		if(df>=a)R=mid-1;
		else L=mid+1;
	}
	int wz=L;
	if(wz<k){
		long long he=0;
		for(int i=1;i<=k;++i)he+=skim(i);
		if(he>=a&&he<=2*a){
			vector<int>v;
			for(int i=1;i<=k;++i)v.emplace_back(i);
			answer(v);
		}else impossible();
		return;
	}
	long long l1[15],l2[15],he=0;
	for(int i=1;i<k;++i)he+=(l1[i]=skim(i));
	if(wz<=n){
		he+=skim(wz);
		if(he>=a&&he<=2*a){
			vector<int>vv;
			for(int i=1;i<k;++i)vv.emplace_back(i);
			vv.emplace_back(wz);
			answer(vv);
			return;
		}
	}
	--wz;
	l1[k]=skim(k);
	for(int i=1;i<=k;++i)l2[i]=skim(wz+i-k);
	he=0;
	for(int i=1;i<=k;++i)he+=l1[i];
	if(he>2*a){
		impossible();
		return;
	}
	he=0;
	for(int i=1;i<=k;++i)he+=l2[i];
	if(he<a){
		impossible();
		return;
	}
	int ff=0;
	while(he>2*a){
		if(ff==n){
			impossible();
			return;
		}
		++ff;
		he-=l2[ff];
		he+=l1[ff];
	}
	vector<int>vv;
	for(int i=1;i<=k;++i){
		if(i<=ff)vv.emplace_back(i);
		else vv.emplace_back(wz+i-k);
	}
	answer(vv);
}
#ifndef ONLINE_JUDGE
int main(){
	int n,k,a,s;
	cin>>n>>k>>a>>s;
	solve(n,k,a,s);
	return 0;
}
#endif