// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define speedup cin.tie(0)->sync_with_stdio(0)
#define bitcount(x) __builtin_popcount(x)
#define all(x) x.begin(),x.end()
#define Tp template<class T>
#define pb emplace_back
Tp using vc=vector<T>;
using ld=long double;
using ll=long long;
inline void solve() {
int n, m;
cin >> n >> m;
int res = n + m - 2;
cout << res << '\n';
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (i == n - 1 && j != m - 1) cout << "-";
else cout << "+";
}
cout << '\n';
}
}
signed main(){
speedup;
int t; cin >> t;
while(t--) solve();
}
