#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
bool edge(int n, int m)
{
if (n == 1) {
cout << m << '\n';
Loop (i,0,m)
cout << '-';
cout << '\n';
return 1;
}
if (m == 1) {
cout << n << '\n';
Loop (i,0,n)
cout << '+' << '\n';
return 1;
}
if (n == 2) {
cout << m << '\n';
Loop (i,0,m)
cout << '-';
cout << '\n';
Loop (i,0,m)
cout << '-';
cout << '\n';
return 1;
}
if (m == 2) {
cout << n << '\n';
Loop (i,0,n)
cout << "++" << '\n';
return 1;
}
if (n <= m && n <= 4) {
cout << m+1 << '\n';
Loop (i,0,n-1) {
Loop (j,0,m)
cout << '-';
cout << '\n';
}
Loop (j,0,m)
cout << '+';
cout << '\n';
return 1;
}
if (m <= n && m <= 4) {
cout << n+1 << '\n';
Loop (i,0,n) {
Loop (j,0,m-1)
cout << '+';
cout << "-\n";
}
return 1;
}
if (n == 6 && m == 6) {
char s[] = {
"++++--\n"
"++++--\n"
"+++-+-\n"
"+++-+-\n"
"+++--+\n"
"+++--+\n"
};
cout << "9\n";
cout << s;
return 1;
}
return 0;
}
const int N = 2010;
int ans[N][N];
void myfill(int n, int m)
{
Loop (i,0,n) {
Loop (j,0,m)
ans[i+1][j+1] = j < m/2? (i&1): !(i&1);
}
}
int mycount(int n, int m)
{
int x = 0;
Loop (i,0,n) {
int cnt = 0;
Loop (j,0,m)
cnt += ans[i][j] == 1;
x += cnt > m/2;
}
Loop (j,0,m) {
int cnt = 0;
Loop (i,0,n)
cnt += ans[i][j] == 0;
x += cnt > n/2;
}
return x;
}
void solve()
{
int n, m;
cin >> n >> m;
if (edge(n, m))
return;
Loop (j,0,m)
ans[0][j] = 0;
Loop (i,0,n)
ans[i][0] = 1;
if (n%2 == 0)
Loop (j,0,m)
ans[n-1][j] = 0;
if (m%2 == 0)
Loop (i,0,n)
ans[i][m-1] = 1;
myfill(n-1 & -2, m-1 & -2);
cout << mycount(n, m) << '\n';
Loop (i,0,n) {
Loop (j,0,m)
cout << "-+"[ans[i][j]];
cout << '\n';
}
}
int main()
{
cin.tie(0) -> sync_with_stdio(false);
int t;
cin >> t;
while (t--)
solve();
}
