#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(),(x).end()
const int dir[][2]={1,0,-1,0,0,1,0,-1};

void solve()
{
    long double a,b;
    cin>>a>>b;
    string ans;
    for(int i=1;i<=20;++i)
        ans+="1";

    long double now=0;
    long double use=0.5;
    string temp;
    while(fabs(now-b)>1E-4L){
        while(use+now-b>1E-4L){
            use/=2;
            temp+="1";
        }
        now+=use;
        temp+="2";
        use/=2;
    }

    reverse(range(temp));
    string res=ans+temp;
    assert(res.size()<=50);

    now=a;
    for(const auto& c:res){
        if(c=='1')
            now/=2;
        else
            now=now/2+.5L;
    }
    // cout<<now<<'\n';
    assert(fabs(now-b)<=1E-4L);
    cout<<ans+temp<<'\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}