#include<bits/stdc++.h>
using namespace std;
const double eps = 1e-4;
double a, b;
map<double, int>cnt;
bool have_answer;
void dfs(double x, string ans) {
	if (have_answer) {
		return;
	}
	if (cnt.count(x)) {
		if (cnt[x] < ans.size()) {
			return;
		} else {
			cnt[x] = ans.size();
		}
	}
	if (ans.size() > 50) {
		return;
	}
	if (fabs(x - b) <= eps) {
		have_answer = 1;
		cout << ans << ' '<< x ;
		return;
	}
	if (x > b) {
		cnt[x / 2] = ans.size() + 1;
		dfs(x / 2, ans + '1');
		if (have_answer) {
			return;
		}
		cnt[(x + 1) / 2] = ans.size() + 1;
		dfs((x + 1) / 2, ans + '2');
		if (have_answer) {
			return;
		}
	} else {
		cnt[(x + 1) / 2] = ans.size() + 1;
		dfs((x + 1) / 2, ans + '2');
		if (have_answer) {
			return;
		}
		cnt[x / 2] = ans.size() + 1;
		dfs(x / 2, ans + '1');
		if (have_answer) {
			return;
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> a >> b;
	string ans = "";
	dfs(a, ans);
	return 0;
}