#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int N=3e6+10;
const int mod=998244353;
ll X,Y;
int T;
map<double,double> pre;
int main()
{

    double b=0.5,x,z;
    cin>>z>>x;
    queue<double> q;
    q.push(z);
    vector<int> ans;
    while(q.size()){
        auto j=q.front();
        q.pop();
        double y=j*0.5;
        if(abs(x-y)<=1e-4){
            pre[y]=j;
            ans.push_back(1);
            y=j;
            while(y!=z){
                if(abs(pre[y]*0.5-y)<=1e-4) ans.push_back(1);
                else ans.push_back(2);
                y=pre[y];
            }
            break;
        }
        if(!pre[y]){
            pre[y]=j;
            q.push(y);
        }
        y=(j-1)*0.5+1;
        if(abs(x-y)<=1e-4){
            pre[y]=j;
            ans.push_back(2);
            y=j;
            while(y!=z){
                if(abs(pre[y]*0.5-y)<=1e-4) ans.push_back(1);
                else ans.push_back(2);
                y=pre[y];
            }
            break;
        }
        if(!pre[y]){
            pre[y]=j;
            q.push(y);
        }
    }
    for(int i=ans.size()-1;i>=0;i--) cout<<ans[i];
    cout<<endl;




}