#include <bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int a, b;
    cin >> a >> b;
    
    const int m = lcm(a, b);

    vector<pair<int, int>> from(m, {-1, 0});
    queue<int> q;
    from[1] = {-1, 0};
    q.push(1);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int i = 0; i < 2; i++) {
            int v = (u * 10 + i) % m;
            if (from[v].first == -1) {
                from[v] = {u, i};
                q.push(v);
            }
        }
    }
    vector<bool> res;
    for (int v = 0; v != 1; v = from[v].first) {
        res.push_back(from[v].second);
    }
    res.push_back(1);
    reverse(res.begin(), res.end());
    for (int x : res) {
        cout << x;
    }
}