#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

long long int gcd(long int a, long int b){
    if(b==0)return a;
    else return gcd(b, a%b);
   }
long long lcm(long long a, long long b){
    return(a*b/gcd(a,b));
}

void megold(long long a, long long b, long long n)
{
    long long lkkt=lcm(a,b);
    int x=0, s=lkkt;
    while(s>0)
    {
        s/=10;
        x++;
    }
    if(x>n)cout<<-1<<endl;
    else{
        cout<<lkkt;
        for(int i=x; i<n; i++)
        {
            cout << 0;
        }
        cout<<endl;
    }
}
int main()
{
    long long a,b,c;
    long long d, e,f;
    long long g, h, j;
    cin >> a >> b >> c;
    cin >> d >> e >> f;
    cin >> g >> h >> j;
    megold(a,b,c);
    megold(d,e,f);
    megold(g,h,j);
    return 0;
}