WA九个点求调

#include<bits/stdc++.h>
#define int long long
using namespace std;//1011
int n,k,ans[200001],sum[20001],cnt=0,b[200001],s1,s2,an;
map<pair<int ,int >,int >mp;
signed main() {
	cin>>n>>k;
	cout<<"?";
	for(int j=1; j<=k+1; j++)if(j!=k+1)cout<<j<<" ";
	cout<<endl;
	cin>>s1;
	sum[k+1]=s1;
	for(int i=k; i>=1; i--) {
		cout<<"?";//101  010
		for(int j=1; j<=k+1; j++)if(j!=i)cout<<j<<" ";
		cout<<endl;
		cin>>s2;
		sum[i]=s2;
		if(s1!=s2)mp[ {i,i+1}]=mp[{i+1,i}]=-1;
		s1=s2;
	}
	b[1]=0;
	for(int i=2; i<=k+1; i++)
		if(mp[ {i,i-1}]==-1)b[i]=!b[i-1];
		else b[i]=b[i-1];
	bool g=1;
	for(int i=k+1; i>=1; i--) {
		int y=0;
		for(int j=1; j<=k+1; j++)if(i!=j)y+=b[j];
		if(y!=sum[i])g=0;
	}
	if(g==0)for(int i=1; i<=k+1; i++)b[i]=!b[i];
	int sum=0;
	for(int i=1; i<k; i++)sum+=b[i];
	sum%=2;
	for(int i=k+2; i<=n; i++) {//1111
		cout<<"?";
		for(int j=1; j<k; j++)cout<<j<<" ";
		cout<<i<<" ";
		cout<<endl;
		cin>>s1;
		if(s1!=sum)b[i]=1;
		else b[i]=0;
	}
	cout<<"!";
	for(int i=1; i<=n; i++)cout<<b[i]<<" ";
	return 0;
}