#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto solve = [&]() {
        i64 A, B, C;
        cin >> A >> B >> C;

        if (lcm(A, B) % C != 0 || lcm(B, C) % A != 0 || lcm(C, A) % B != 0) {
            cout << "NO\n";
            return;
        }

        if (A == B && B == C) {
            if (A == 2) {
                cout << "NO\n";
            } else {
                for (int i = 0; i < A; i++) {
                    cout << (i == 0);
                }
                cout << '\n';
                for (int i = 0; i < A; i++) {
                    cout << (i == 1);
                }
                cout << '\n';
                for (int i = 0; i < A; i++) {
                    cout << (i <= 1);
                }
                cout << '\n';
            }
            return;
        }

        // A = lcm(X, Y), B = lcm(Y, Z), C = lcm(Z, X)
        i64 X = gcd(C, A);
        i64 Y = gcd(A, B);
        i64 Z = gcd(B, C);

        i64 x = X == Y ? -1 : 0;
        i64 y = Y == Z ? -1 : 0;
        i64 z = Z == X ? -1 : 0;

        for (int i = 0; i < A; i++) {
            cout << (i % X == x ^ i % Y == y);
        }
        cout << '\n';
        for (int i = 0; i < B; i++) {
            cout << (i % Y == y ^ i % Z == z);
        }
        cout << '\n';
        for (int i = 0; i < C; i++) {
            cout << (i % Z == z ^ i % X == x);
        }
        cout << '\n';
    };

    while (t--) {
        solve();
    }
    
    return 0;
}