#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 2e18,N = 5e5+1,MOD = 1e9+7;
void solve() {
//lb1 --> max(n,m)
//m tekse n+m/2
//n tekse m+n/2
int n,m;
cin >> n >> m;
int ans = max({max(n,m),(m%2)?(n+m/2):0ll,(n%2)?(m+n/2):0ll});
cout << ans << endl;
if (max(n,m) == ans) {
for (int i = 1;i<=n;i++) {
for (int j = 1;j<=m;j++) cout << ((n >= m)?'+':'-');
cout << '\n';
}
return;
}
if (m%2 && ans == n+m/2) {
for (int i=1;i<=n;i++) {
for (int j = 1;j<=m;j++) {
if (j%2) cout << '+';
else cout << '-';
}
cout << '\n';
}
return;
}
for (int i=1;i<=n;i++) {
for (int j = 1;j<=m;j++) {
if (i%2) cout << '-';
else cout << '+';
}
cout << '\n';
}
return;
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
cin >> t;
while (t --> 0) solve();
}
