#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mod = 998244353;
const int N = 1e5+10;
int dis[N];
int p[N];
int path[N];

void solve() {
	double sa, sb;
	double a = 0;
	ll b = 0;
	int i, j;
	cin>>sa>>sb;
//	printf("%d\n", 1<<23);
	b = sb * (1<<20);
	for (i = 1; i <= 20; i++) {
		cout<<1;
	}
	for (i = 0; i < 20; i++) {
		if (b&(1<<i)) cout<<2, a = a/2 + 0.5;
		else cout<<1, a /= 2;
	}
//	cout<<a<<'\n';
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
//	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}