#include <cstdio>

using namespace std;

__attribute__((always_inline)) void read(int &num)
{
    static char inBuffer[0x30D40];

    static unsigned int p = 0x30D3F; num = 0x0;

    while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
    {
        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }

    while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }
}

char outBuffer[0x61A80]; unsigned int p;

__attribute__((always_inline)) void write(unsigned int x)
{
    unsigned int digits = x > 0x3B9AC9FF ? 0xA :
                 x > 0x5F5E0FF  ? 0x9 :
                 x > 0x98967F   ? 0x8 :
                 x > 0xF423F    ? 0x7 :
                 x > 0x1869F    ? 0x6 :
                 x > 0x270F     ? 0x5 :
                 x > 0x3E7      ? 0x4 :
                 x > 0x63       ? 0x3 :
                 x > 0x9        ? 0x2 : 0x1;

    for(unsigned int i = ~-digits; ~i; --i)
    {
        outBuffer[p + i] = x % 0xA + 0x30;

        x = x / 0xA;
    }

    p = p + digits; outBuffer[p++] = 0x20;
}

int n;
int a,b;

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

const int N=2000000+5;
int t[N];
bool cif[N];
bool viz[N];

int q[N],pp,u;

int main() {
    freopen("multiplu.in","r",stdin);
    scanf("%d %d",&a,&b);
    n=a*b/gcd(a,b);
    if(n==1) {
        printf("1\n");
        return 0;
    }
    viz[1]=1;
    t[1]=-1;
    cif[1]=1;
    q[1]=pp=u=1;
    while(pp<=u) {
        int cur=q[pp];
        pp++;
        for(int i=0;i<=1;i++) {
            int nou=(cur*10+i)%n;
            if(viz[nou]==0) {
                viz[nou]=1;
                t[nou]=cur;
                cif[nou]=i;
                q[++u]=nou;
                if(nou==0) {
                    break;
                }
            }
        }
    }
    int nod=0,ans=0;
    while(nod!=-1) {
        q[++ans]=cif[nod];
        nod=t[nod];
    }
    freopen("multiplu.out","w",stdout);
    for(int i=ans;i>=1;i--) {
        printf("%d",q[i]);
    }
    printf("\n");
    return 0;
}