  #include <bits/stdc++.h>
  #define MOD 1000000007
  #define test int t; cin>>t; while(t--)
  #define init(arr,val) memset(arr,val,sizeof(arr))
  #define loop(i,a,b) for(int i=a;i<b;i++)
  #define loopr(i,a,b) for(int i=a;i>=b;i--)
  #define loops(i,a,b,step) for(int i=a;i<b;i+=step)
  #define looprs(i,a,b,step) for(int i=a;i>=b;i-=step)
  #define ull unsigned long long int
  // #define int long long int
  #define P pair
  #define PLL pair<long long, long long>
  #define PII pair<int, int>
  #define PUU pair<unsigned long long int, unsigned long long int>
  #define L list
  #define V vector
  #define D deque
  #define ST set
  #define MS multiset
  #define M map
  #define UM unordered_map
  #define mp make_pair
  #define pb push_back
  #define pf push_front
  #define MM multimap
  #define F first
  #define S second
  #define IT iterator
  #define RIT reverse_iterator
  #define FAST ios_base::sync_with_stdio(false);cin.tie();cout.tie();
  #define FILE_READ_IN freopen("input.txt","r",stdin);
  #define FILE_READ_OUT freopen("output.txt","w",stdout);
  #define all(a) a.begin(),a.end()
  #define ld long double
  using namespace std;
  // const ll maxn = 1e5;
  // const ll inf = 1e9;
  const double pi = acos(-1);
  // map<int,string>arr;
  void solve()
  {
    string prim[]={"3","5","13","17","103","107","1091","1093","15581","15601","155581","155593","1555607","1555613","15555569","15555587","155555591","155555597"};
    int a,b,c;
    cin>>a>>b>>c;
    int dp=2*(a-c);
    int da=2*(b-c);
    if(a==b){
      da++;
    }
    for(int i=0; i<c-1; i++)
    {
      prim[da]+="0";
      prim[dp]+="0";
    }
    cout<<prim[dp]<<" "<<prim[da]<<endl;
  }
  int32_t main(){
    int n=1;
    cin>>n;
    while(n--){
      solve();
    }
    return 0;
  }