#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
char jog[N][N];
int main () {
// freopen("input.txt", "r", stdin);
int t;
cin >> t;
while ( t-- ) {
int n, m, jogap = 0;
cin >> n >> m;
if (min(n, m) == 1) {
char c;
if (n == 1) c = '-';
else c = '+';
jogap = max (n, m);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
jog[i][j] = c;
}
}
}
else if (n >= m) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
jog[i][j] = '1';
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m / 2 + 1; ++j) {
jog[i][j] = '+';
}
}
jogap = n + (m - (m / 2 + 1));
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (jog[i][j] == '1') jog[i][j] = '-';
}
}
}
else {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
jog[i][j] = '1';
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n / 2 + 1; ++j) {
jog[j][i] = '-';
}
}
jogap = m + (n - (n / 2 + 1));
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (jog[i][j] == '1') jog[i][j] = '+';
}
}
}
cout << jogap << endl;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cout << jog[i][j];
}
cout << endl;
}
}
}
