#include <bits/stdc++.h>
using namespace std;
map<array<int,3>,int> was;
int n,m,k,q;
int Ask(int i,int j,int k){
if(was.count({i,j,k}))return was[{i,j,k}];
if(i<1||j<1||k<1||i>n||j>m||k>::k)return 0;
printf("? %i %i %i\n",i,j,k);
fflush(stdout);
int b;scanf("%i",&b);
was[{i,j,k}]=b;
return b;
}
void Ans(int i,int j,int k){
printf("! %i %i %i\n",i,j,k);
fflush(stdout);
exit(0);
}
void Check(int i,int j,int k){
int now=Ask(i,j,k);
for(int a=-1;a<=1;a+=2)
if(now<max({Ask(i+a,j,k),Ask(i,j+a,k),Ask(i,j,k+a)}))
return;
Ans(i,j,k);
}
int main(){
scanf("%i %i %i %i",&n,&m,&k,&q);
if(m==1&&k==1){
int top=n,bot=1,mid;
while(top>bot){
mid=top+bot>>1;
if(Ask(mid,1,1)<Ask(mid+1,1,1))bot=mid+1;
else top=mid;
}
Ans(bot,1,1);
}else if(k==1){
int X1=1,X2=n,Y1=1,Y2=n;
while(X1+1<X2&&Y1+1<Y2){
int Xm=X1+X2>>1;
int mx=0,pos=0;
for(int i=Y1;i<=Y2;i++){
int now=Ask(Xm,i,1);
if(now>mx)mx=now,pos=i;
}
if(Ask(Xm-1,pos,1)>mx){
X2=Xm-1;
}else if(Ask(Xm+1,pos,1)>mx){
X1=Xm+1;
}else Ans(Xm,pos,1);
int Ym=Y1+Y2>>1;
mx=0,pos=0;
for(int i=X1;i<=X2;i++){
int now=Ask(i,Ym,1);
if(now>mx)mx=now,pos=i;
}
if(Ask(pos,Ym-1,1)>mx){
Y2=Ym-1;
}else if(Ask(pos,Ym+1,1)>mx){
Y1=Ym+1;
}else Ans(pos,Ym,1);
}
for(int i=X1;i<=X2;i++){
for(int j=Y1;j<=Y2;j++){
Check(i,j,1);
}
}
}else{
}
return 0;
}
