#include <bits/stdc++.h>
// mrrrowwww meeowwwww :3
// go play vivid/stasis! !! !!! https://vividstasis.gay
#define fo(i, a, b) for (auto i = (a); i < (b); i++)
#define of(i, a, b) for (auto i = (b); i-- > (a);)
#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define be(a) a.begin(), a.end()
using namespace std;
int ____init = []{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
return 0;
}();
int n, m, k;
map<pair<int, pair<int, int>>, int> cache;
int humidity(int x, int y, int z) {
if (x >= 1 && y >= 1 && z >= 1 && x <= n && y <= m && z <= k && !cache.count({ x, { y, z } })) {
cout << "? " << x << ' ' << y << ' ' << z << endl;
cin >> cache[{ x, { y, z } }];
}
return cache[{ x, { y, z } }];
}
void answer(int x, int y, int z) {
cout << "! " << x << ' ' << y << ' ' << z << endl;
}
template <typename F>
int bin_search_axis(int c, int m, F &&check) {
if (m > 1 && check(c) >= max(check(c - 1), check(c + 1))) {
return c;
}
int l = 1, r = m;
while (l < r) {
int mid = (l + r) / 2;
if (check(mid) < check(mid + 1)) l = mid + 1;
else r = mid;
}
return l;
}
int main() {
int q; cin >> n >> m >> k >> q;
int x = (n + 1) / 2, y = (m + 1) / 2, z = (k + 1) / 2;
bool changed;
do {
int px = x, py = y, pz = z;
x = bin_search_axis(x, n, [&](int x) { return humidity(x, y, z); });
y = bin_search_axis(y, m, [&](int y) { return humidity(x, y, z); });
z = bin_search_axis(z, k, [&](int z) { return humidity(x, y, z); });
changed = px != x || py != y || pz != z;
} while (changed);
answer(x, y, z);
}
