#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

queue<long long> q;

ifstream in ("multiplu.in");
ofstream out ("multiplu.out");

int gcd(int a, int b)
{
    if (b == 0) return a;
	return gcd(b, a % b);
}

int main()
{
    int a,b,scm;
    in >> a >> b;
    scm=(a*b)/gcd(a,b);
    q.push(1);
    while(!q.empty())
    {
        long long u=q.front();
        q.pop();
        if(!(u%scm))
        {
            out << u;
            return 0;
        }
        q.push(u*10);
        q.push(u*10+1);
    }
    return 0;
}