#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 360, M = 41;

double a,b,eps=1e-4;
string ans="";
bool flag=0;

void dfs(double x){
	if(ans.size()>=50 || flag)return;

	if(abs(x-a)<=eps){
		flag=1;
	}

	if(x<=0.5){
		ans+="1";
		dfs(x*2);
	}

	if(x>0.5 && x<=1){
		ans+="2";
		dfs(2*x-1);
	}
}

void solve(){
	cin >> a >> b;
	dfs(b);
	double tmp=a;
	for (int i = ans.size() - 2; i >= 0; i--)
	{	
		cout << ans[i];
	}
}

int main()
{

	ll _;
	_ = 1;
	//cin >> _;
	while (_--)
	{
		solve();
	}
}