#include <bits/stdc++.h>
using namespace std;
#define sp << " " <<
#define int long long
#define vi vector<int>
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
void solve() {
int n,m;
cin >> n >> m;
int needrow = (m%2)?((m+1)/2):(m/2+1);
int didrow = (n%2)?n/2:(n/2-1);
int needrow2 = n/2+1;
int didrow2 = m/2+1;
char grid[n+1][m+1];
if (m+didrow >= didrow2+needrow2) {
F(i,n) F(j,m) grid[i][j] = '-';
cout << m+didrow << endl;
for (int i=1;i<=didrow;i++) {
for (int j=1;j<=needrow;j++) {
grid[i][j] = '+';
}
}
}
else {
cout << didrow2+needrow2 << endl;
F(i,n) F(j,m) grid[i][j] = '-';
for (int i=1;i<=didrow2;i++) {
for (int j=1;j<=needrow2;j++) {
grid[j][i] = '+';
}
}
}
F(i,n){
F(j,m) cout << grid[i][j];
cout << endl;
}
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Local
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int t = 1;
cin >> t;
F(i,t) solve();
}
