#include <iostream>
#include <numeric>
#include <cmath>
#include <algorithm>
using namespace std;
int cigany(long long a, long long b, long long n)
{
    long long x=lcm(a,b);
    long long y=pow(10,n-1);
    long long z=pow(10,n);
    if(n<=12)
    {
        if(floor(z/x)==floor(y/x))
        {
            cout << -1;
        }
        else cout << (floor(y/x)+1)*x;
    }
    else
    {
        cout << x;
        int t=x, p=0;
        while(t!=0)
        {
            p++;
            t=t/10;
        }
        for(int i=0; i<n-p; i++) cout << 0;
    }
}
int main()
{
    long long a,b,c;
    cin >> a >> b >> c;
    long long d, e,f;
    long long g, h, j;
    cin >> d >> e >> f;
    cin >> g >> h >> j;
    cigany(a,b,c);
    cout << endl;
     cigany(d,e,f);
     cout << endl;
     cigany(g,h,j);
     cout << endl;

    return 0;
}