#include <bits/stdc++.h>

using namespace std;

#define all(c) (c).begin(), (c).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define Sum(a) accumulate((a).begin(), (a).end() , 0ll)
#define Min(a) *std::min_element((a).begin(), (a).end())
#define Max(a) *std::max_element((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
#define each(x, a) for(auto& x : a)
#define mst(a, x) memset(a, x, sizeof(a))
#define LL long long
#define rep(i, from, to) for(LL i = from;i<to;i++)
#define rrep(i, from, to) for(LL i = from;i>to;i--)
#define to_uni(a) a.erase(unique(begin(a), end(a)), end(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl "\n"
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
const int P = 998244353;
const int INF = 0x3f3f3f3f;
const int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
const int fx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}, fy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

double eps = 1e-4;

void solve()
{   
    double a,b;
    cin >> a >> b;

    string s;
    queue<pair<double , string>> q;
    q.emplace(a,s);
    map<double ,int> S;
    while(q.size())
    {
        auto [x,o] = q.front();
        if(o.size() > 50) continue;
        if(abs(x - b) <= eps)
        {
            // cout << fixed << setprecision(10) << x << " " << b << endl;
            cout << o << endl;
            return;
        }
        q.pop();
        double sa = x * 0.5 , sb = (x+1) * 0.5;
        if(!S.count(sa))
        {
            S[sa] ++;
            q.emplace(sa,o+'1');
        }
        if(!S.count(sb))
        {
            S[sb] ++ ;
            q.emplace(sb,o+'2');
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--)
    solve();    

    return 0;
}