//yukicoder@cpp17 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using P = pair; const ll MOD = 998244353; const ll MODx = 1000000007; const int INF = (1<<30)-1; const ll LINF = (1LL<<62LL)-1; const double EPS = (1e-10); P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}}; P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; template vector make_vector(size_t a, T b) { return vector(a, b); } template auto make_vector(size_t a, Ts... ts) { return vector(a, make_vector(ts...)); } /* 確認ポイント cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる 計算量は変わらないが楽できるシリーズ min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる */ /* function corner below */ /* Function corner above */ __attribute__((constructor)) void initial() { cin.tie(0); ios::sync_with_stdio(false); } int main(){ int n; long long s;cin>>n>>s; vector A(n/2),B(n/2+(n%2)); int divide = n/2; for(int i = 0; n/2 > i; i++){ cin>>A[i]; } for(int i = 0; n/2+(n%2) > i; i++){ cin>>B[i]; } map adex; vector X[(1<<(n/2))+2]; for(int i = 0; (1<<(n/2)) > i; i++){ long long sm = 0; for(int j = 0; n/2 > j; j++){ if((1< bdex; vector Y[(1<<((n/2+(n%2))))+2]; for(int i = 0; (1<<((n/2+(n%2)))) > i; i++){ long long sm = 0; for(int j = 0; (n/2+(n%2)) > j; j++){ if((1<> ret; for(auto x: bdex){ if(adex[s-x.first]){ for(int i = 0; X[adex[s-x.first]].size() > i; i++){ for(int j = 0; Y[x.second].size() > j; j++){ int Xnw = X[adex[s-x.first]][i]; int Ynw = Y[x.second][j]; vector ans; int ind = 0; while(Xnw){ if(Xnw%2){ ans.push_back(ind+1); } Xnw/=2; ind++; } ind = divide; while(Ynw){ if(Ynw%2){ ans.push_back(ind+1); } Ynw/=2; ind++; } ret.push_back(ans); } } } } sort(ret.begin(),ret.end()); for(int i = 0; ret.size() > i; i++){ for(int j = 0; ret[i].size() > j; j++){ cout << ret[i][j] << " \n"[j+1 == ret[i].size()]; } } }