#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("multiplu.in");
ofstream fout("multiplu.out");
int c,ok,dp[2000005],viz[2000005],cif[2000005];
vector<int>v;
queue<int>q;
int p;
int cmmdc(int a,int b)
{
    int r;
    while(b)
    {
        r=a%b;
        a=b;
        b=r;
    }
    return a;
}
void rec(int r)
{
    if(r==0)
    {
        ok=1;
        while(r!=1)
        {
            v.push_back(cif[r]);
            r=dp[r];
        }
        v.push_back(1);
        for(int i=v.size()-1;i>=0;i--)fout<<v[i];
        return;
    }
    if(dp[(r*10)%c]==0)
    {
        dp[(r*10)%c]=r;
        cif[(r*10)%c]=0;
        q.push((r*10)%c);
    }
    if(dp[(r*10+1)%c]==0)
    {
        dp[(r*10+1)%c]=r;
        cif[(r*10+1)%c]=1;
        q.push((r*10+1)%c);
    }
}
int main()
{
    int a,b;
    fin>>a>>b;
    c=(a*b)/(cmmdc(a,b));
    q.push(1);
    cif[1]=1;
    while(!q.empty() && ok==0)
    {
        p=q.front();
        rec(p);
        q.pop();
    }
    return 0;
}