Hamilton

input/code.cpp: In function 'void dfs(long long int, std::vector<long long int>)':
input/code.cpp:109:37: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  109 |                         if(re.size()==n&&i==re[0]){
      |                            ~~~~~~~~~^~~

#include <bits/stdc++.h>
using namespace std;

#define rz(a,n)a.resize(n); 
#define mset multiset
#define mii map<int,int>
#define str string
#define dbl double
#define i128 __int128
#define to_string tos

#define all(x) x.begin(), x.end()

#define srtl(x)sort(all(x))
#define srtg(x)sort((x).begin(),(x).end(),greater<>())
#define rev(x) reverse(all(x))
#define lb(x,y) lower_bound(x.begin(),x.end(),y)-x.begin()
#define ub(x,y) upper_bound(x.begin(),x.end(),y)-x.begin()

#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define f first
#define s second
#define pb push_back
#define ins insert
#define next next_permutation(all())
#define _b __builtin_popcount

#define ve vector
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<piii>
#define vvi vector<vi>
#define vst vector<string>
#define vb vector<bool>

#define pV(x)for(auto i:x)cout<<i<<" ";

#define geta(a){for(auto &i:a)cin>>i;}
#define getaa(a){for(int i=1;i<a.size();i++)cin>>a[i];}

#define fri(n)for(int i=0;i<n;i++)
#define frj(j,m)for(int j=0;j<n;j++)
#define ff(v,x,y)for(int v=x;v<y;v++)
#define Fr(n)for(int i=n-1;i>=0;i--)

#define suma(a)accumulate(a.begin(),a.end(),0LL)

#define br(x){cout<<x<<"\n";return;}
#define yesn cout<<"YES\n";

#define yes()br("YES");
#define no(){br("NO")}

#define alice() br("Alice");
#define bob() br("Bob");

#define cn continue;

#define cint const int
#define int long long


int mod=1000000007;
cint mod1=100000007;
cint mod2=998244353;

int ax[8]={0,1,0,-1,-1,1,1,-1};
int ay[8]={1,0,-1,0,1,-1,1,-1};

//bool on(int x,int y){return (x>=0&&x<n&&y>=0&&y<m);}
//int euc(int a,int b,int c,int d){return abs(a-c)+abs(b-d);}

int bp(int x,int y){
	if(y==0)return 1;
	int r=bp(x,y/2);
	return (y&1)?r*r%mod*x%mod:r*r%mod;
}
int bpm(int x,int y){
	if(y==0)return 1;
	int r=bpm(x,y/2);
	return (y&1)?r*r*x:r*r;
}

int cinn(){
	int n;
	cin>>n;
	return n;
}
#define w cinn()

int n;

char mt[5][5];
cint N=501;
int vis[N];
int to[N];
int tto=0;
vi res;
bool fl=0;
void dfs(int nod,vi re){
	vis[nod]=1;
	if(fl)return;
	for(int i=1;i<=n;i++){
		if(i==nod||mt[nod][i]=='<')cn;
		if(vis[i]){
			if(re.size()==n&&i==re[0]){
				res=re;fl=1;
			}
			else cn;
		}
		to[nod]=i;
		re.pb(i);
		dfs(i,re);
		re.erase(re.begin()+re.size()-1);
	}
	vis[nod]=0;
}

void solve(){
	
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			cout<<"? "<<i<<" "<<j<<"\n";
			cin>>mt[i][j];
		}
	}
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<i;j++){
			if(mt[j][i]=='>')mt[i][j]='<';
			if(mt[j][i]=='<')mt[i][j]='>';
		}
	}
	for(int i=1;i<=n;i++)dfs(i,{i});
	cout<<"! ";pV(res);
	cout<<"\n";
}

int32_t main(){
	
	//ios;

	int t=1;
	cin>>n>>t;
	
	for(int i=0;i<n;i++){
	for(int j=0;j<n;j++){
		if(j<=i)cout<<0;
		else cout<<1;
	}
	cout<<"\n";
	}
	while(t--){fl=0;res={};
		for(int&i:to)i=0;
		for(int&i:vis)i=0;
		solve();
	}
	
	return 0;
}



/*
3 1
> < >

*/

Test 1

Subtask:

Verdict: WRONG ANSWER

Test 2

Subtask: 1

Verdict: WRONG ANSWER

Test 3

Subtask: 2, 3

Verdict: WRONG ANSWER

Test 4

Subtask: 4

Verdict: WRONG ANSWER