#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define endl '\n'
//#define inf 1e18
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef pair<ll, ll> P;
#define x first
#define y second
#define int long long

// const int p = 1e9 + 7;
const int pp = 998244353;

int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int ddx[8] = {1, 1, 2, 2, -1, -1, -2, -2}, ddy[8] = {2, -2, 1, -1, 2, -2, 1, -1};

ll ksm(ll a, ll b, ll p) {
    ll ans = 1;
    while(b) {
        if(b & 1) ans = (ans * a) % p;
        b >>= 1;
        a = (a * a) % p;
    }
    return ans % p;
}

std::mt19937 rng;  // 随机数生成器  
int rand(int l, int r) {
    std::uniform_int_distribution<int> distribution(l, r);
    return distribution(rng);
}

typedef pair<int, double> PP;

void solve() {
    double a, b, s = 0.5;
    cin >> a >> b;
    vector<int> ans;
    while(a > 1e-4) {
        ans.emplace_back(1);
        a *= s;
    }
    vector<int> v;
    for(int i = 0; i < 30; i++) {
        b = b * 2;
        if(b >= 1) {
            b -= 1.0;
            v.emplace_back(1);
            // cout << 1;
        }
        else {
            v.emplace_back(0);
            // cout << 0;
        }
    }
    // cout << endl;
    while(v.size()) {
        if(v.back() == 1) {
            ans.emplace_back(2);
            a = (a - 1) * s + 1;
        }
        else {
            ans.emplace_back(1);
            a = a * s;
        }
        v.pop_back();
    }
    // cout << "a : " << a << endl;
    assert(ans.size() <= 50);
    for(auto & x : ans) {
        cout << x;
    }
    cout << endl;
}


/*	



*/

signed main () {
    // init(minp, primes, m); // primes
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    // init();
    int _ = 1;
//   cin >> _;
    while(_ -- ) {
        solve();
    }
    return 0;
}