
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <iostream>
#include <set>
#include <queue>
#include <vector>

using namespace std;

bool is_prime(int64_t x) {
    for (int64_t i = 2; i * i <= x; i++)
        if (x % i == 0)
            return false;
    return true;
}

int gcd(int x, int y) {
    return y == 0 ? x : gcd(y, x % y);
}

pair <int, int> calc(int a, int b, int c) {
    int64_t p = 1;
    for (int i = 0; i < c - 1; i++)
        p *= 10;
    while (!is_prime(p))
        p++;

    int64_t x = p, y = p;
    for (int i = 0; i < a - c; i++)
        x *= 10;
    for (int i = 0; i < b - c; i++)
        y *= 10;
    y += p;
    return {x, y};
}

void check() {
    for (int a = 1; a <= 9; a++)
        for (int b = 1; b <= 9; b++)
            for (int c = 1; c <= min(a, b); c++) {
                auto xy = calc(a, b, c);
                int g = gcd(xy.first, xy.second);
                if (to_string(xy.first).size() != a)
                    cout << "a " << a << " " << b << " " << c << endl;
                if (to_string(xy.second).size() != b)
                    cout << "b " << a << " " << b << " " << c << endl;
                if (to_string(g).size() != c)
                    cout << "c " << a << " " << b << " " << c << endl;
            }
}

void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    auto xy = calc(a, b, c);
    cout << xy.first << ' ' << xy.second << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // check();

    int T;
    cin >> T;
    while (T--) {
        solve();
    }
}
