#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
using namespace std;
#define rep(n) for (int i = 0; i < n; ++i)
#define rep2(n) for (int j = 0; j < n; ++j)
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
map<array<int,3>, int> save;
array<int, 3> max_id (int i, int j1, int k1, int j2, int k2) {
int ma = 0, cur, idj = j1, idk = k1;
for (int j = j1; j <= j2; ++j) {
for (int k = k1; k <= k2; ++k) {
cout << "? " << i << " " << j << " " << k << "\n" << flush;
cin >> cur;
save[{i,j,k}] = cur;
if (cur==-1) return {-1, -1, -1};
if (cur>ma) {
ma = cur;
idj = j, idk = k;
}
}
}
return {ma, idj, idk};
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k, q;
cin >> n >> m >> k >> q;
int lo = 1, hi = n, mid, l, r;
array<int, 3> a;
while (lo<hi) {
mid = (lo+hi)/2, l = 0, r = 0;
a = max_id(mid, 1, 1, m, k);
if (a[0]==-1) return 0;
if (mid>1) {
if (!save[{mid-1,a[1],a[2]}]) {
cout << "? " << mid-1 << " " << a[1] << " " << a[2] << "\n" << flush;
cin >> l;
save[{mid-1,a[1],a[2]}] = l;
}
else l = save[{mid-1,a[1],a[2]}];
if (l==-1) return 0;
if (l>a[0]) {
hi = mid-1;
continue;
}
}
if (mid<n) {
if (!save[{mid+1,a[1],a[2]}]) {
cout << "? " << mid+1 << " " << a[1] << " " << a[2] << "\n" << flush;
cin >> r;
save[{mid+1,a[1],a[2]}] = r;
}
else r = save[{mid+1,a[1],a[2]}];
if (r==-1) return 0;
if (r>a[0]) {
lo = mid+1;
continue;
}
}
lo = mid;
break;
}
cout << "! " << lo << " " << a[1] << " " << a[2] << "\n" << flush;
return 0;
}
