#include <bits/stdc++.h>
// #pragma GCC optimize(2)
#define int long long
#define pii pair<int, int>
#define tpi tuple<int, int, int, int>
#define il inline
#define p_q priority_queue
#define u_m unordered_map
#define bt bitset
#define rg register

using namespace std;

const int N1 = 300005;
const int N2 = 1000006;
const int mod = 998244353;

using i64 = long long;

void chmin(int& x, int c) {
	x = min(x, c);
}
void chmax(int& x, int c) {
	x = max(x, c);
}

#define debug 1
#define multi_test_ 1
#define endl '\n'

int _test_ = 1;

namespace zqh {
	int a, b, c;
	char ch[300][300];

	void init() {
		cin >> a >> b >> c;
		for (int i = 1; i <= 299; i++) {
			for (int j = 1; j <= 299; j++) {
				ch[i][j] = '.';
			}
		}
	}

	void solve() {
		for (int i = 1; i <= 2 * c + 1; i++) {
			for (int j = 1; j <= 2 * a + 1; j++) {
				ch[i + 2 * b][j] = (i & 1) ? ((j & 1) ? '+' : '-') : ((j & 1) ? '|' : '.');
			}
		}
		for (int i = 1; i <= 2 * b + 1; i++) {
			for (int j = 2 * b + 2 - i, k = 1; k <= 2 * a + 1; j++, k++) {
				if (i & 1) {
					if (k & 1) {
						ch[i][j] = '+';
					} else {
						ch[i][j] = '-';
					}
				} else {
					if (k & 1) {
						ch[i][j] = '/';
					} else {
						ch[i][j] = '.';
					}
				}
			}
		}
		for (int i = 1; i <= 2 * b + 1; i++) {
			int j = 2 * (a + b) + 1 - (2 * b + 1 - i);
			for (int k = 0; k < 2 * c + 1; k++) {
				int ti = 2 * b + 2 - i + k;
				if (i & 1) {
					if (k & 1) {
						ch[ti][j] = '|';
					} else {
						ch[ti][j] = '+';
					}
				} else {
					if (k & 1) {
						ch[ti][j] = '.';
					} else {
						ch[ti][j] = '/';
					}
				}
			}
		}
		for (int i = 1; i <= 2 * (c + b) + 1; i++) {
			for (int j = 1; j <= 2 * (a + b) + 1; j++) {
				cout << ch[i][j];
			}
			cout << endl;
		}
	}

	void main() {
		init();
		solve();
	}
}  // namespace zqh

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifdef debug
#endif
#ifdef multi_test_
	cin >> _test_;
#endif
	while (_test_--) {
		zqh::main();
	}
	return 0;
}
/*

*/