#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 1010;
int n, m;
char w[MAX_N][MAX_N];
#define rev(w) (w == '+' ? '-' : '+')
void solve() {
cin >> n >> m;
bool rot = false;
if (n > m) rot = true, swap(n, m);
auto gen = [&]() {
for (int i = 0;i < n;++i) for (int j = 0;j < m;++j)
w[i][j] = '-';
int res = m;
vector<int> cnt(m);
// height should < mxh
int filwid = (m + 1) / 2, mxh = (n + 1) / 2;
for (int i = 0, H = 0;i < n;++i) {
bool todo = true;
for (int j = 0;j < filwid;++j)
if (++cnt[ (H + j) % m ] == mxh)
todo = false;
if (!todo) break;
for (int j = 0;j < filwid;++j)
w[i][ (H + j) % m ] = '+';
H += filwid, H %= m;
++res;
}
return res;
};
int cnt = gen();
cout << cnt << '\n';
if (rot) {
swap(n, m);
for (int i = 0;i < n;++i) {
for (int j = 0;j < m;++j)
cout << rev(w[j][i]);
cout << '\n';
}
}
else {
for (int i = 0;i < n;++i) {
for (int j = 0;j < m;++j)
cout << w[i][j] ;
cout << '\n';
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int T;
cin >> T;
while (T--)
solve();
}
