#include <bits/stdc++.h>
using namespace std;
int n, m, a[31];
vector<int>ans;
void dfs(int id, int sum, int ch) {
if (sum == m) {
ans.push_back(ch);
return;
}
for(int i=id; i<n; i++) {
if (sum + a[i] > m) break;
if (ch & (1 << i)) continue;
dfs(i+1, sum+a[i], ch | (1 << i));
}
}
int main() {
while(cin >> n >> m) {
ans.clear();
for(int i=0; i<n; i++) cin >> a[i];
sort(a, a+n);
dfs(0, 0, 0);
if (ans.size() == 0) cout << -1 << endl;
for(int r: ans) {
for(int i=0; i<31; i++) {
if (r & (1 << i)) cout << a[i] << " ";
}
cout << endl;
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBuLCBtLCBhWzMxXTsKdmVjdG9yPGludD5hbnM7CnZvaWQgZGZzKGludCBpZCwgaW50IHN1bSwgaW50IGNoKSB7CglpZiAoc3VtID09IG0pIHsKCQlhbnMucHVzaF9iYWNrKGNoKTsKCQlyZXR1cm47Cgl9Cglmb3IoaW50IGk9aWQ7IGk8bjsgaSsrKSB7CgkJaWYgKHN1bSArIGFbaV0gPiBtKSBicmVhazsKCQlpZiAoY2ggJiAoMSA8PCBpKSkgY29udGludWU7CgkJZGZzKGkrMSwgc3VtK2FbaV0sIGNoIHwgKDEgPDwgaSkpOwoJfQp9CmludCBtYWluKCkgewoJd2hpbGUoY2luID4+IG4gPj4gbSkgewoJCWFucy5jbGVhcigpOwoJCWZvcihpbnQgaT0wOyBpPG47IGkrKykgY2luID4+IGFbaV07CgkJc29ydChhLCBhK24pOwoJCWRmcygwLCAwLCAwKTsKCQlpZiAoYW5zLnNpemUoKSA9PSAwKSBjb3V0IDw8IC0xIDw8IGVuZGw7CgkJZm9yKGludCByOiBhbnMpIHsKCQkJZm9yKGludCBpPTA7IGk8MzE7IGkrKykgewoJCQkJaWYgKHIgJiAoMSA8PCBpKSkgY291dCA8PCBhW2ldIDw8ICIgIjsKCQkJfQoJCQljb3V0IDw8IGVuZGw7CgkJfQoJfQoJcmV0dXJuIDA7Cn0=