#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,K;cin>>N>>K; auto ask=[&](vl S)->ll{ assert(sz(S)==2*K); rep(i,0,2*K)S[i]++; sort(all(S)); assert(1<=S[0]&&S[2*K-1]<=N); rep(i,0,2*K-1)assert(S[i]>r; return r-1; }; vl S(2*K); iota(all(S),0); ll x=ask(S); vl A,B; rep(i,0,2*K)if(i!=x){ S[i]=2*K; if(x==ask(S))A.emplace_back(i); else B.emplace_back(i); S[i]=i; } vl SMALL,LARGE; if(sz(A)==K-1){ SMALL=A; SMALL.emplace_back(2*K); LARGE=B; } else{ assert(sz(A)==K); SMALL=B; SMALL.emplace_back(x); LARGE=A; } S=SMALL; S.insert(S.end(),all(LARGE)); ll kth=ask(S); rep(i,2*K+1,N){ S=SMALL; S.insert(S.end(),all(LARGE)); S[2*K-1]=i; ll x=ask(S); if(x==kth)continue; SMALL.erase(find(all(SMALL),kth)); SMALL.emplace_back(i); kth=x; } auto ans=SMALL; sort(all(ans)); rep(i,0,K)ans[i]++; cout<<"! "<