#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 500;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
const int dx[] = {-1, 1, 0, 0, 0, 0};
const int dy[] = {0, 0, -1, 1, 0, 0};
const int dz[] = {0, 0, 0, 0, -1, 1};
const double PHI = 1.61803398875;
int n, m, k, q;
int mem[N * N * N + 5];
int num(int x, int y, int z) {
return (x - 1) * m * k + (y - 1) * k + z - 1;
}
int ask(int x, int y, int z) {
if (x < 1 || x > n || y < 1 || y > m || z < 1 || z > k) return 0;
int &ans = mem[num(x, y, z)];
if (ans != 0) return ans;
assert(--q > 0);
cout << "? " << x << ' ' << y << ' ' << z << endl;
cin >> ans; return ans;
}
void answer(int x, int y, int z) {
cout << "! " << x << ' ' << y << ' ' << z << endl;
exit(0);
}
signed main() {
cin >> n >> m >> k >> q;
int candidates = q / 2, x = 1, y = 1, z = 1;
for (int _ = 0; _ < candidates; ++_) {
int cx = random(1, n), cy = random(1, m), cz = random(1, k);
if (ask(cx, cy, cz) > ask(x, y, z)) x = cx, y = cy, z = cz;
}
while (q > 0) {
for (int i = 0; i < 6; ++i) {
int nx = x + dx[i], ny = y + dy[i], nz = z + dz[i];
if (ask(nx, ny, nz) > ask(x, y, z)) {
x = nx, y = ny, z = nz;
}
}
}
answer(x, y, z);
return 0;
}
