#include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<char>> grid(n, vector<char>(m));
if (n > m) {
if (m == 1) {
cout << n << '\n';
for (int i = 0; i < n; ++i) cout << "+\n";
} else if (m == 2) {
cout << n << '\n';
for (int i = 0; i < n; ++i) cout << "++\n";
} else {
cout << n + 1 << '\n';
for (int i = 0; i < n; ++i) cout << "+-+\n";
}
} else {
if (n == 1) {
cout << m << '\n';
for (int i = 0; i < m; ++i) cout << "-";
cout << '\n';
} else if (n == 2) {
cout << m << '\n';
for (int i = 0; i < m; ++i) cout << "-";
cout << '\n';
for (int i = 0; i < m; ++i) cout << "-";
cout << '\n';
} else {
cout << m + 1 << '\n';
for (int i = 0; i < m; ++i) cout << "-";
cout << '\n';
for (int i = 0; i < m; ++i) cout << "+";
cout << '\n';
for (int i = 0; i < m; ++i) cout << "-";
cout << '\n';
}
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int tc;
cin >> tc;
while (tc--) {
solve();
}
};
