#include<bits/stdc++.h>
#define LL long long
#define DB double
#define MOD 1000000007
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) ((-x) & x)
#define MP make_pair
#define VI vector<int>
#define VL vector<LL>
#define VII VI::iterator
#define VLI VL::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define PII pair<int, int>
#define SI set<int>
#define SII SI::iterator
#define fi first
#define se second
using namespace std;
template<typename T> void chkmn(T &a, const T &b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T &b) { (a < b) && (a = b); }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int inc(const int &a, const int &b) { return (a + b >= MOD) ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return (a - b < 0) ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		k >>= 1, Sqr(x);
	}
	return res;
}
const int N = 105;
int T, a, b, c, n, m; 
char ans[N][N];
void paintH1(int row, int p)
{
//	printf("H1 %d %d\n", row, p);
	for(int i = 0; i <= a; ++i)
		ans[row][p + 2 * i] = '+';
	for(int i = 0; i < a; ++i)
		ans[row][p + 2 * i + 1] = '-';
}
void paintH2(int row, int p)
{
//	printf("H2 %d %d\n", row, p);
	for(int i = 0; i <= a; ++i)
		ans[row][p + 2 * i] = '/';
}
void paintV1(int col, int p)
{
//	printf("V1 %d %d\n", col, p);
	for(int i = 0; i <= c; ++i)
		ans[p - 2 * i][col] = '+';
	for(int i = 0; i < c; ++i)
		ans[p - 2 * i - 1][col] = '|';
}
void paintV2(int col, int p)
{
	for(int i = 0; i <= c; ++i)
		ans[p - 2 * i][col] = '/';
}
void work()
{
	scanf("%d %d %d", &a, &b, &c);
	for(int i = 0; i < N; ++i)
		for(int j = 0; j < N; ++j)
			ans[i][j] = '.';
	n = 2 * (b + c) + 1;
	m = 2 * (a + b) + 1;
	for(int i = 0; i <= b + c; ++i)
	{
		int row = 1 + 2 * i;
		int p = max(1, m - 2 * a - 2 * i);
		paintH1(row, p);
	}
	for(int i = 1; i <= b; ++i)
	{
		int row = 2 * i;
		int p = m - 2 * a - 2 * i + 1;
		paintH2(row, p);
	}
	for(int i = 0; i <= a + b; ++i)
	{
		int col = m - 2 * i;
		int p = min(n, 2 * c + 2 * i + 1);
		paintV1(col, p);
	}
	for(int i = 1; i <= b; ++i)
	{
		int col = m - 2 * i + 1;
		int p = 2 * c + 2 * i;
		paintV2(col, p);
	}
	for(int i = 1; i <= n; ++i)
	{
		for(int j = 1; j <= m; ++j)
			putchar(ans[i][j]);
		puts("");
	}
}
int main()
{
	scanf("%d", &T);
	while(T--) work();
	return 0;
}