#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define int long long
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e3+5;
int n, m, q;
char a[N][N], ans[N][N];
void solve(){
cin>>n>>m;
bool sw = 0;
if(n > m){
swap(n, m);
sw = 1;
}
if(m + (n-1)/2 >= (m - (m%2 ? 1:2)) + n + (n % 2 ? -1 :-2)){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) a[i][j] = '-';
}
for(int i=0;i<(n-1)/2;i++){
for(int j=0;j<m;j++) a[i][j] = '+';
}
cout<<m + (n-1)/2<<"\n";
}else{
for(int i=0;i<n;i++){
for(int j=0;j<m;j++) a[i][j] = '-';
}
for(int i=0;i<n/2;i++){
for(int j=0; j<=m/2; j++) a[i][j] = '+';
}
for(int i=n/2;i<n-1;i++){
for(int j=(m/2 - (m%2 ? 0:1)); j<m; j++) a[i][j] = '+';
}
cout<<(m - (m%2 ? 1:2)) + n-1<<"\n";
}
if(sw){
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
ans[i][j] = a[j][i];
if(ans[i][j] == '-') ans[i][j] = '+';
else ans[i][j] = '-';
}
}
swap(n, m);
}else{
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
ans[i][j] = a[i][j];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<ans[i][j];
}cout<<"\n";
}
return;
}
signed main(){
fastios
int t = 1;
cin>>t;
while(t--) solve();
return 0;
}
