#include <bits/stdc++.h>
#define int long long
std::map<int, int> arr;
int N, M, K, Q;
int query(int x, int y, int z)
{
if (1 <= x && x <= N && 1 <= y && y <= M && 1 <= z && z <= K && arr[x * (M * K) + y * K + z] == 0)
{
printf("? %lld %lld %lld\n", x, y, z);
fflush(stdout);
int ans = -1;
(void)scanf("%lld", &ans);
if (ans == -1)
exit(0);
arr[x * (M * K) + y * K + z] = ans;
}
return arr[x];
}
void guess(int x, int y, int z)
{
printf("! %lld %lld %lld\n", x, y, z);
exit(0);
}
const double phi = 0.618033988749894848204586;
std::mt19937 rd(std::chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
(void)scanf("%lld %lld %lld %lld", &N, &M, &K, &Q);
int bestX = 1, bestY = 1, bestZ = 1, bestAns = 0;
int i = 1;
for (; i <= Q / 2; i++)
{
int x = abs((int)rd()) % N + 1;
int y = abs((int)rd()) % M + 1;
int z = abs((int)rd()) % K + 1;
assert(x <= N);
assert(y <= M);
assert(z <= K);
if (query(x, y, z) > bestAns)
bestAns = query(x, y, z), bestX = x, bestY = y, bestZ = z;
}
while (1)
{
int x = bestX, y = bestY, z = bestZ;
for (int dx = -1; dx <= 1; dx++)
for (int dy = -1; dy <= 1; dy++)
for (int dz = -1; dz <= 1; dz++)
if (abs(dx) + abs(dy) + abs(dz) == 1)
{
int ans = query(x + dx, y + dy, z + dz);
if (ans > bestAns)
{
bestAns = query(x + dx, y + dy, z + dz);
bestX = x + dx, bestY = y + dy, bestZ = z + dz;
goto next;
}
}
next:
bestX += 0;
if (x == bestX && y == bestY && z == bestZ)
break;
}
guess(bestX, bestY, bestZ);
}
// 1 4 2 5 8 | 4 2 5 4 2 | 1 4 2 5 8 | 4 2 5 4 2
