//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
mt19937_64 rng(time(0));
void modify(string &A,string &B)
{
	int g=__gcd(sz(A),sz(B));
	string val(g,'0');
	for(auto &ch:val) if(rng()&1) ch='1';
	for(int i=0;i<sz(A);i++)
		if(val[i%g]&1)
			A[i]^=1;
	for(int i=0;i<sz(B);i++)
		if(val[i%g]&1)
			B[i]^=1;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		ll a,b,c;
		cin>>a>>b>>c;
		if(a==2&&b==2&&c==2)
			cout<<"No\n";
		else
		{
			ll A=a*b/__gcd(a,b);
			ll B=b*c/__gcd(b,c);
			ll C=c*a/__gcd(c,a);
			if(A%c||B%a||C%b)
				cout<<"No\n";
			else
			{
				cout<<"Yes\n";
				string S(a,'0');
				string T(b,'0');
				string U(c,'0');
				modify(S,T);
				modify(T,U);
				modify(U,S);
				cout<<S<<'\n';
				cout<<T<<'\n';
				cout<<U<<'\n';
			}
		}
	}
	return 0;
}