#include <bits/stdc++.h>
using namespace std;
ifstream f("multiplu.in");
ofstream g("multiplu.out");

int a, b;
queue <int> q;

void solve () {
    bool ok = true;
    q.push (1);
    while (ok && !q.empty()) {
        int k = q.front();  q.pop();
        if (k % a == 0 && k % b == 0) {
            ok = false;
            g << k;
        }
        else {
            q.push (k * 10);
            q.push (k * 10 + 1);
        }
    }
}

int main()
{
    f >> a >> b;
    solve ();
    return 0;
}