#include<bits/stdc++.h>
#define endl '\n'
#pragma GCC optimize(3)

using namespace std;


const int N=1e6+10;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef pair<int , int> PII;
double n,m;
bool flag = false;
vector<int> f(55);
void dfs(double num,int step,int count) {
    if(count > 50)
        return;
    if( flag )
        return;
    if(step == 1) {
        num = num*0.5;
        f[count] = 1;
    }
    if(step == 2) {
        num = num*0.5 + 0.5;
        f[count] = 2;
    }
    if(abs(num - m) <= 1e-4) {
        for( int i = 1 ; i <=count ; i ++ )
            cout << f[i];
        flag = true;
        return;
    }
    dfs(num,1,count + 1);
    dfs(num,2,count + 1);

}

void sol() {
    cin >> n >> m;
    int cnt = 0;
    dfs(n,1,1);
    if(!flag) {
        dfs(n,2,1);
    }
}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
//    cin >> T;
//    while( T -- )
    sol();
    return 0;
}