#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#define endl '\n'
#define ios ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
typedef long long LL;

const int N = 4e5 + 10;
const int MOD = 998244353;

vector<int> res;

void solve() {
    double a, b;
    cin >> a >> b;
    int cnt = 0;
    while (a > 1e-4) {
        a *= 0.5;
        cnt++;
    }
    a = 0;
    double s = 0.5;
    while (abs(a - b) > 1e-4) {
        if (a + s > b) {
            res.push_back(1);
        } else {
            res.push_back(2);
            a += s;
        }
        s *= 0.5;
    }
    std::reverse(res.begin(), res.end());
    for (int i = 1; i <= cnt; ++i) {
        cout << 1;
    }
    for (auto i : res) {
        cout << i;
    }
}

signed main() {
    ios;
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
}