#pragma GCC optimize("O3") #include using namespace std; using ll=long long; using P=pair; template using V=vector; #define fi first #define se second #define all(v) (v).begin(),(v).end() const ll inf=(1e18); //const ll mod=998244353; const ll mod=1000000007; const vector dy={-1,0,1,0},dx={0,-1,0,1}; ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;} ll LCM(ll c,ll d){return c/GCD(c,d)*d;} struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout< bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } templatevoid debag(const vector &a){cerr<<"debag :";for(auto v:a)cerr<void print(const vector &a){for(auto v:a)cout<,bool> mul; map sum; int main(){ int n,k; cin>>n>>k; V a(n); for(int i=0;i>a[i]; } sort(all(a)); V> d(n); V cp=a; for(int i=0;i tmp={}; ll num=0; ll val=1; bool ok=true; for(int j=0;jll(1e9)){ ok=false; } for(int v:d[j])tmp.emplace_back(v); num+=a[j]; } } sort(all(tmp)); sum[num]; if(ok)sum[val]; else mul[tmp]; } for(auto &p:mul){ print(p.fi); } cout<