#include<bits/stdc++.h>
using namespace std;
int arr[100];
int query(int x, int y, int z) {
printf("? %d %d %d\n", x, y, z);
fflush(stdout);
#ifdef ONPC
return arr[x];
#endif
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);
#ifdef ONPC
printf("[%d %d %d]", arr[x-1], arr[x], arr[x+1]);
fflush(stdout);
if (!(arr[x-1] <= arr[x] && arr[x] >= arr[x+1])) {
for (int i = 1; i <= 15 ;i++)
cout << arr[i] << ' ';
cout << endl;
assert(false);
}
#endif
exit(0);
}
int main() {
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int N, M, K, Q;
(void)scanf("%d %d %d %d", &N, &M, &K, &Q);
assert(M == 1 && K == 1);
#ifdef ONPC
for (int i = 1; i <= N; i++)
arr[i] = rng() % 100 + 1;
#endif
vector<int> cache(N+1);
auto ask = [&](int x) {
if (cache[x]) return cache[x];
return cache[x] = query(x, 1, 1);
};
if (N == 1) {
guess(1, 1, 1);
}
int l = 1, r = N;
int e1=-1, e2=-1;
if (ask(l) >= ask(l+1)) {
guess(l, 1, 1);
}
if (ask(r-1) <= ask(r)) {
guess(r, 1,1);
}
while (l < r-1) {
int m = (l+r) / 2;
int a = ask(m), b = ask(m+1);
if (a == b) {
e1 = m;
e2 = m+1;
}
if (a >= b) {
r = m;
} else {
l = m;
}
}
if (l != 1 && (ask(l-1) <= ask(l) && ask(l) >= ask(l+1)))
guess(l, 1, 1);
if (r != N && (ask(r-1) <= ask(r) && ask(r) >= ask(r+1)))
guess(r, 1, 1);
if (ask(e1-1) <= ask(e1) && ask(e1) >= ask(e2))
guess(e1, 1, 1);
else guess(e2, 1, 1);
}
