1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <fstream>
 8 #include <cassert>
 9 #include <cstdio>
10 #include <bitset>
11 #include <vector>
12 #include <deque>
13 #include <queue>
14 #include <stack>
15 #include <ctime>
16 #include <set>
17 #include <map>
18 #include <cmath>
19
20 using namespace std;
21
22 typedef long long ll;
23 const int maxn = 66;
24
25 ll n, k;
26 ll path[maxn][3];
27 int pcnt;
28 //1 + 0 -
29 bool exflag;
30 void dfs(ll cur, ll lv, ll id) {
31     if(exflag) return;
32     if(cur == n && lv == k) {
33         for(ll i = 0; i < pcnt; i++) {
34             printf("%I64d %c\n", path[i][0], path[i][1] == 1 ? '+' : '-');
35         }
36         exflag = 1;
37         return;
38     }
39     if(cur != n && lv == k) return;
40
41     path[pcnt][0] = id;
42     path[pcnt++][1] = 1;
43     dfs(cur+id ,lv+1, id*2);
44     pcnt--;
45
46     path[pcnt][0] = id;
47     path[pcnt++][1] = 1;
48     dfs(cur+id ,lv+1, id*2+1);
49     pcnt--;
50
51     path[pcnt][0] = id;
52     path[pcnt++][1] = 0;
53     dfs(cur-id ,lv+1, id*2);
54     pcnt--;
55
56     path[pcnt][0] = id;
57     path[pcnt++][1] = 0;
58     dfs(cur-id ,lv+1, id*2+1);
59     pcnt--;
60 }
61
62 int main() {
63     // freopen("in", "r", stdin);
64     int T, _ = 1;
65     scanf("%d", &T);
66     while(T--) {
67         scanf("%I64d %I64d", &n, &k);
68         pcnt = 0; exflag = 0;
69         printf("Case #%d:\n", _++);
70         dfs(0, 0, 1);
71     }
72     return 0;
73 }

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>using namespace std;typedef long long ll;
const int maxn = 66;
ll n, k;
ll f[maxn];
ll ans[maxn];
bool sub[maxn];void init() {f[0] = 1;for(int i = 1; i < maxn; i++) {f[i] = f[i-1] * 2;}
}int main() {// freopen("in", "r", stdin);int T, _ = 1;init();scanf("%d", &T);while(T--) {scanf("%I64d %I64d", &n, &k);for(int i = 1; i <= k; i++)ans[i] = f[i-1];if(n % 2 == 0) ans[k]++;ll nn = 1 << k;bool exflag = 0;for(ll i = 1; i < nn; i++) {if(exflag) break;ll cur = 0;memset(sub, 0, sizeof(sub));for(ll j = 1; j <= k; j++) {if((1 << j) & i) {sub[j] = 1;cur -= ans[j];}else cur += ans[j];}if(cur == n) exflag = 1;}printf("Case #%d:\n", _++);for(ll i = 1; i <= k; i++) {printf("%I64d ", ans[i]);if(sub[i]) printf("-\n");else printf("+\n");}}return 0;
}