#include <iostream>
#include <algorithm>
using namespace std;
int x[101] = {0};
int a[101] = {0};
int c = 0;
int n = 0;
int flag = 0;
int sum = 0;
void backtrace(int i) {
if (i == n) {
if (sum == c) {
flag = 1;
for (int i=1; i<=n; i++) {
if (x[i])
printf ("%3d", a[i]);
}
printf ("\n");
}
} else {
sum += a[i];
x[i] = 1;
backtrace(i+1);
x[i] = 0; //开始回溯
sum -= a[i];
backtrace(i+1);
}
}
int main() {
scanf ("%d %d", &n, &c);
for (int i=1; i<=n; i++) {
scanf ("%d", &a[i]);
}
backtrace(1);
if (flag == 0) {
printf ("No!\n");
} else {
printf ("Yes!\n");
}
return 0;
}
#include <algorithm>
using namespace std;
int x[101] = {0};
int a[101] = {0};
int c = 0;
int n = 0;
int flag = 0;
int sum = 0;
void backtrace(int i) {
if (i == n) {
if (sum == c) {
flag = 1;
for (int i=1; i<=n; i++) {
if (x[i])
printf ("%3d", a[i]);
}
printf ("\n");
}
} else {
sum += a[i];
x[i] = 1;
backtrace(i+1);
x[i] = 0; //开始回溯
sum -= a[i];
backtrace(i+1);
}
}
int main() {
scanf ("%d %d", &n, &c);
for (int i=1; i<=n; i++) {
scanf ("%d", &a[i]);
}
backtrace(1);
if (flag == 0) {
printf ("No!\n");
} else {
printf ("Yes!\n");
}
return 0;
}