#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define int long long 
#define endl "\n"
const int N = 3e5+10;
const long double eps = 1e-8;
int n,m,k;
typedef pair<int,int> PII;
void solve()
{
    long double a,b;
    cin>>a>>b;
    long double bs=1.0;
    
    for(int i = 0;i <= 50;i ++, bs /= 2.0F)
    {
        long double na = a * bs;
        long double c = b - na;
        if(c < -eps) continue;
        long double t = 0.5;
        vector<int> op;
        for(int j = 0; j < i; j++, t /= 2.0F)
        {
            if(c >= t) 
            {
                c-= t;
                op.push_back(2);
            }
            else op.push_back(1);
        }
        if(fabs(c) < eps) 
        {
            reverse(op.begin(), op.end());
            for(int j: op) cout << j;
            cout << '\n';
            break;
        }
    }
}
signed  main()
{
   ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int t=1;
//   cin>>t;
   while(t--)
   {
       solve();
   }
    return 0;
}