#include <bits/stdc++.h>
#define sz(x) (long long)(x).size()
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 5, M = 1e6 + 7, SM = 1e3 + 5, logN = 20;
const long long MOD = 1e9 + 7, INF = 1e18 + 9;
const int dx[] = {1, 0, 0, -1, -1, 1, -1, 1};
const int dy[] = {0, 1, -1, 0, -1, 1, 1, -1};
void debug() {
cerr << "\n";
}
template<typename Head, typename... Tail>
void debug(Head a, Tail... b) {
cerr << a << " ";
debug(b...);
}
void fill(vector<vector<long long>> &a, long long x) {
long long n = sz(a), m = sz(a[0]);
for(long long i = 0; i < n; i++) {
for(long long j = 0; j < m; j++) {
a[i][j] = x;
}
}
}
long long div_ceil(long long a, long long b) {
return (a + b - 1) / b;
}
long long calc(vector<vector<long long>> a) {
long long n = sz(a), m = sz(a[0]);
vector<long long> rows(n), cols(m);
for(long long i = 0; i < n; i++) {
for(long long j = 0; j < m; j++) {
if(a[i][j] == 1) {
rows[i]++;
}
else {
cols[j]++;
}
}
}
long long res = 0;
for(long long i = 0; i < n; i++) {
if(rows[i] >= div_ceil(m + 1, 2)) res++;
}
for(long long j = 0; j < m; j++) {
if(cols[j] >= div_ceil(n + 1, 2)) res++;
}
return res;
}
void print(vector<vector<long long>> a) {
long long n = sz(a), m = sz(a[0]);
for(long long i = 0; i < n; i++) {
for(long long j = 0; j < m; j++) {
cout << (a[i][j] ? "+" : "-");
}
cout << "\n";
}
}
int main() {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
long long q; cin >> q;
while(q--) {
long long n, m; cin >> n >> m;
vector<vector<long long>> grid(n, vector<long long>(m)), ans(n, vector<long long>(m));
vector<long long> rows(n, m);
fill(grid, 1);
{
long long last = 0;
for(long long j = 0; j < m; j++) {
long long i = last, cnt = n / 2 + 1;
while(cnt) {
if(rows[i] > m / 2 + 1) {
grid[i][j] = 0;
rows[i]--, cnt--;
}
i++;
if(i == n) {
i = 0;
}
if(i == last) {
break;
}
}
if(!cnt) {
last = i;
}
else {
break;
}
}
if(calc(ans) < calc(grid)) {
ans = grid;
}
}
vector<long long> cols(m, n);
fill(grid, 0);
{
long long last = 0;
for(long long i = 0; i < n; i++) {
long long j = last, cnt = m / 2 + 1;
while(cnt > 0) {
if(cols[j] > n / 2 + 1) {
grid[i][j] = 1;
cols[j]--, cnt--;
}
j++;
if(j == m) {
j = 0;
}
if(j == last) {
break;
}
}
if(!cnt) {
last = j;
}
else {
break;
}
}
if(calc(ans) < calc(grid)) {
ans = grid;
}
}
cout << calc(ans) << "\n";
print(ans);
}
cout << endl;
return 0;
}
