#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(int i=0;i> N >> Q; vector v,u; int X; for(i=1;i> X; if(X==1){ v.push_back(i+1); u.push_back(i); } else if(X==0){ v.push_back(i); u.push_back(i+1); } else{ return 0; } } int mx=0; int n=v.size(); for(i=1;i> X; if(X==1) mx=i; else if(X==0) continue; else return 0; } int mn=0; for(i=1;i> X; if(X==1) continue; else if(X==0) mn=i; else return 0; } cout << "!" << ' ' << u[mn] << ' ' << u[mn] << ' ' << v[mx] << ' ' << N << endl; cout.flush(); return 0; }