#include <bits/stdc++.h>

#define PB push_back

using namespace std;

const int N = 1e6 + 500;

int A[3][N], n[3];

void svi(int a) {
	assert(a > 2);
	for(int i = 0;i < n[0];i++) {
		A[0][i] ^= (i % a == 0);
	}
	for(int i = 0;i < n[1];i++) {
		A[1][i] ^= (i % a == 1);
	}
	for(int i = 0;i < n[2];i++) {
		A[2][i] ^= (i % a < 2);
	}
}

void lupi(int a, int b, int p1, int p2, int p3) {
	for(int i = 0;i < n[p1];i++) {
		A[p1][i] ^= (i % a == 0);
	}
	for(int i = 0;i < n[p2];i++) {
		A[p2][i] ^= (i % a == 0);
		A[p2][i] ^= (i % b == 0);
	}
	for(int i = 0;i < n[p3];i++) {
		A[p3][i] ^= (i % b == 0);
	}
}

vector < int > ps;

void factor(int x) {
	for(int i = 2;i * i <= x;i++) {
		if(x % i) continue;
		ps.PB(i);
		for(;!(x%i);x/=i);
	}
	if(x - 1) ps.PB(x);
}

void solve() {
	scanf("%d%d%d", n, n + 1, n + 2);
	if(n[0] == 2 && n[1] == 2 && n[2] == 2) {
		printf("NO\n");
		return;
	}
	for(int j = 0;j < 3;j++) {
		for(int i = 0;i < n[j];i++)
			A[j][i] = 0;
	}
	ps.clear();
	factor(n[0]), factor(n[1]), factor(n[2]);
	sort(ps.begin(), ps.end());
	ps.erase(unique(ps.begin(), ps.end()), ps.end());
	int fak = 1;
	for(int x : ps) {
		int v[3] = {1,1,1};
		for(int j = 0;j < 3;j++)
			while(n[j] % (v[j] * x) == 0) v[j] *= x;
		v[0] *= fak, v[1] *= fak, v[2] *= fak;
		int mks = max(v[0], max(v[1], v[2]));
		int cnt = (v[0] == mks) + (v[1] == mks) + (v[2] == mks);
		if(cnt == 3) {
			if(mks == 2) {
				fak = 2; continue;
			} else {
				svi(v[0]);
			}
		} else if(cnt == 1){
			printf("NO\n");
			return;
		} else {
			int j = 0;
			while(v[j] == mks) j++;
			lupi(mks, v[j], (j + 1) % 3, (j + 2) % 3, j);
		}
	}
	printf("YES\n");
	for(int j = 0;j < 3;j++) {
		for(int i = 0;i < n[j];i++)
			printf("%d", A[j][i]);
		printf("\n");
	}
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}