#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(777);
int query(int x, int y, int z) {
printf("? %d %d %d\n", x, y, z);
fflush(stdout);
int ans = -1;
(void)scanf("%d", &ans);
if (ans == -1) exit(0);
return ans;
}
__attribute__((noreturn))
void guess(int x, int y, int z) {
printf("! %d %d %d\n", x, y, z);
exit(0);
}
typedef long long ll;
int N, M, K;
map<ll, int> mp;
int ask(int x, int y, int z){
if (x < 1 || x > N) return 0;
if (y < 1 || y > M) return 0;
if (z < 1 || z > K) return 0;
ll val = x * 2'000'010'000'100LL + y * 1'000'002LL + z;
if (mp.find(val) != mp.end()) return mp[val];
return mp[val] = query(x, y, z);
}
void check(int x, int y, int z){
if (ask(x, y, z) < ask(x - 1, y, z)) return;
if (ask(x, y, z) < ask(x + 1, y, z)) return;
if (ask(x, y, z) < ask(x, y - 1, z)) return;
if (ask(x, y, z) < ask(x, y + 1, z)) return;
if (ask(x, y, z) < ask(x, y, z - 1)) return;
if (ask(x, y, z) < ask(x, y, z + 1)) return;
guess(x, y, z);
}
int main() {
int Q;
(void)scanf("%d %d %d %d", &N, &M, &K, &Q);
for (int y = 1; y <= M; y++) {
for (int z = 1; z <= K; z++) {
int l = 1, r = N;
int ans = -1;
while (l <= r) {
int mid = l + rng() % (r - l + 1);
int val1 = ask(mid, y, z), val2 = ask(mid + 1, y, z);
if (val1 >= val2) {
ans = mid;
r = mid - 1;
} else {
ans = mid + 1;
l = mid + 1;
}
}
check(ans, y, z);
}
}
}
