#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, m, rev;
int ans[1009][1009];
int tmp[1009][1009];
int cur[1009];
void solve(){
cin >> n >> m;
rev = 0;
if(n > m){
rev = 1;
swap(n, m);
}
for(int i = 0; i < n; ++i)
cur[i] = 0;
for(int j = 0; j < m; ++j){
int need = (n+2)/2;
for(int i = 0; i < n; ++i){
if(cur[i] > m/2 || n-i == need){
--need;
ans[i][j] = 0;
}
else{
++cur[i];
ans[i][j] = 1;
}
}
}
int totval = m;
for(int i = 0; i < n; ++i)
if(cur[i] > m/2)
++totval;
if(rev){
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
tmp[j][i] = ans[i][j];
swap(n, m);
for(int i = 0; i < n; ++i)
for(int j = 0; j < m; ++j)
ans[i][j] = tmp[i][j];
}
cout << totval << '\n';
for(int i = 0; i < n; ++i){
for(int j = 0; j < m; ++j){
if(ans[i][j]^rev)
cout << '+';
else
cout << '-';
}
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
int t;
cin >> t;
while(t--)
solve();
}
