#include <bits/stdc++.h>
#define ll int
#define en "\n"
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define fi first
#define se second
#define rep(i, a, b) for(ll i = a; i <= b; ++i)
#define per(i, a, b) for(ll i = a; i >= b; --i)
#define kaizokuO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define r0 return 0
#define all(v) v.begin(), v.end()
#define MAX(v) *max_element(all(v))
#define MIN(v) *min_element(all(v))
#define gcd(a,b) __gcd(a,b);
#define lcm(a,b) (a*b)/ __gcd(a, b)
#define bitt(x) __builtin_popcount(x)
#define fill1(arr, i, n) for(ll a = 0; a <= n; ++a) arr[a] = i;
#define fill2(arr, i, n, m) for(ll a = 0; a <= n; ++a) for(ll b = 0; b <= m; ++b) arr[a][b] = i;
#define flsh fflush(stdout)
#define ext exit(0)
#define inp freopen("input.txt","r",stdin)
#define outp freopen("output.txt","w",stdout)
using namespace std;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
//const ll mod = 26101991;
//const ll mod = 1e8;
//const ll mod = 1e9+9;
//const double pi = 3.14159265;
void solve(){
ll n, m; cin >> n >> m;
if(n > m){
cout << n+((m-1)/2) << en;
if(m%2==0){
for(ll i = 1; i <= n; ++i){
for(ll j = 1; j < m; ++j) cout << (j%2?'+':'-');
cout << '+';
cout << en;
}
} else {
for(ll i = 1; i <= n; ++i){
for(ll j = 1; j <= m; ++j) cout << (j%2?'+':'-');
cout << en;
}
}
} else {
cout << m+((n-1)/2) << en;
if(n%2==0){
for(ll i = 1; i < n; ++i){
for(ll j = 1; j <= m; ++j){
cout << (i%2?'-':'+');
}
}
for(ll i = 1; i <= m; ++i){
cout << '-';
}
cout << en;
} else {
for(ll i = 1; i <= n; ++i){
for(ll j = 1; j <= m; ++j){
cout << (i%2?'-':'+');
}
cout << en;
}
}
}
}
int main() {
kaizokuO;
ll t = 1; cin >> t;
while(t--){
solve();
}
}
