#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);
     int t=x, p=0;
            while(t!=0)
        {
            p++;
            t=t/10;
        }
    if(p>=n)
    {
        cout << -1;
    }
    else
    {
        cout << x;
        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;
}