#include <iostream>
#include <string>
#include <fstream>
#include <algorithm>
#include <queue>

using namespace std;

inline int cmmdc(int a,int b)
{
    int r;
    while(b)
    {
        r = a % b;
        a = b;
        b = r;
    }
    return a;
}

inline int cmmmc(int a,int b)
{
    return a*b/cmmdc(a,b);
}

inline int modulo(string s,int nr)
{
    int ans = 0;
    for(int i = 0 ; i < s.size() ; i++)
        ans = (ans*10+(int)(s[i]-'0'))%nr;
    return ans%nr;
}

inline string BFS(int p)
{
    queue<string>q;
    q.push("1");
    string temp;
    while(!q.empty())
    {
        temp = q.front();
        q.pop();
        int rest = modulo(temp,p);
        if(rest == 0)
            return temp;
        q.push(temp+"0");
        q.push(temp+"1");
    }
}

int main()
{
    ifstream cin("multiplu.in");
    ofstream cout("multiplu.out");
    int a,b,p;
    cin >> a >> b;
    p = cmmmc(a,b);
    cout << BFS(p);
    return 0;
}