#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define p pair<int,int>
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
using namespace std;

int main(){
	
	int x,y,z;
	int x2,y2,z2;
	x=150,y=0,z=0;
	x2=-150,y2=0,z2=0;
	int d1,d2;
	printf("? %d %d %d\n",x,y,z);
	cin>>d1;
	while(1){
		printf("? %d %d %d\n",x2,y2,z2);
		cin>>d2;
		if(max(x-x2,x2-x)==1){
			if(d1>d2){
				x=x2;
			}
			break;
		}
		if(d1<d2){
			x2=(x+x2)/2;
		}else{
			d1=d2;
			int save=x;
			x=x2;
			x2=(save+x2)/2;
		}
		
	}
	x2=x;
	y=150;
	y2=-150;
	printf("? %d %d %d\n",x,y,z);
	cin>>d1;
	while(1){
		printf("? %d %d %d\n",x2,y2,z2);
		cin>>d2;
		if(max(y-y2,y2-y)==1){
			if(d1>d2){
				y=y2;
			}
			break;
		}
		if(d1<d2){
			y2=(y+y2)/2;
		}else{
			d1=d2;
			int save=y;
			y=y2;
			y2=(save+y2)/2;
		}
	}

	y2=y;
	z=150;
	z2=-150;
	printf("? %d %d %d\n",x,y,z);
	cin>>d1;
	while(1){
		printf("? %d %d %d\n",x2,y2,z2);
		cin>>d2;
		if(max(z-z2,z2-z)==1){
			if(d1>d2){
				z=z2;
			}
			break;
		}
		if(d1<d2){
			z2=(z+z2)/2;
		}else{
			d1=d2;
			int save=z;
			z=z2;
			z2=(save+z2)/2;
		}
	}
	
	printf("! %d %d %d\n",x,y,z);
}