func_code_string: #include <iostream>   #include<bits/stdc++.h>   #include<vector>   #define fo(i,n) for(long long i=0;i<n;i++)   #define ll long long int   #define inf 999999999999999999   #define pb push_back   #define fi first   #define se second   #define vi vector<ll>   #define vii vector<vector<ll>>   #define pi pair<ll,ll>   #define mp make_pair   #define MOD 1000000007   #define tr(c,it) for(auto it = (c).begin(); it != (c).end(); ++it)   #define fio ios_base::sync_with_stdio(false);cin.tie(0);   using namespace std;   //cerr<<   n  <<  Time elapsed :  << clock() * 1000.0 / CLOCKS_PER_SEC <<   ms n  ;   //freopen( explicit.in ,  r , stdin);   //freopen( explicit.out ,  w , stdout);       void SieveOfEratosthenes()    {        bool prime[10000001];       memset(prime, true, sizeof(prime));             for (ll p=2; p*p<=10000000; p++)        {            if (prime[p] == true)            {                // Update all multiples of p greater than or                 // equal to the square of it                // numbers which are multiple of p and are                // less than p^2 are already been marked.                 for (ll i=p*p; i<=10000000; i += p) {                   prime[i] = false;                }           }        }     }    ll binpow(ll a, ll b) {       ll res = 1;       while (b > 0) {           if (b & 1)               res = (res * a);           a = (a * a);           b >>= 1;       }       return res;   }   ll gcd(ll a,ll b)   {       if(b%a==0)          return a;       return gcd(b%a,a);   }   ll power(ll x,ll y,ll p)    {        ll r = 1;            x = x % p;       while (y > 0) {           if (y & 1)                r = (r * x) % p;           y = y >> 1;            x = (x * x) % p;        }        return r;    }     ll modInverse(ll n, ll p)    {        return power(n, p - 2, p);    }        ll nCrModP(ll n,ll r, ll p)    {        ll fac[100005];       if (r == 0)            return 1;             return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;    }   int32_t main()    {       fio       ll j,i,n,t,l,s,r,c,h,k,m,maxi,d,a,b,x;       cin>>t;       string w;       for(i=0;i<t;i++)       {           cin>>a>>b>>c;           s=0;           for(j=0;j<c;j++)           {               s=s*10+1;           }           l=s;           while(true)           {               x=s;               d=0;               while(x!=0)               {                   x=x/10;                   d++;               }               if(d==a)                   break;               s=s*2;           }           m=s;           s=l;           while(true)           {               x=s;               d=0;               while(x!=0)               {                   x=x/10;                   d++;               }               if(d==b)                   break;               s=s*3;           }           cout<<m<<   <<s<<endl;           // cout<<__gcd(m,s)<<endl;       }   }                                    