#include <bits/stdc++.h>

std::ifstream in("multiplu.in");
std::ofstream out("multiplu.out");

constexpr int N = 2e6;
bool vis[N];
int prev_mod[N];
int digit_count[N];
bool digit[N];
bool ans[N];

/// Returns the greatest common divisor of a and b.
int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a % b);
}

void bfs(int mod) {
	std::queue<int> q{{1}};
	vis[1] = true;
	prev_mod[1] = -1;
	digit[1] = 1;
	digit_count[1] = 1;
	bool found_0 = false;
	while (!(q.empty() || found_0)) {
		int m = q.front();
		q.pop();
		auto visit = [&](bool d) {
			int new_m = (m * 10 + d) % mod;
			if (vis[new_m]) {
				return;
			}
			q.push(new_m);
			vis[new_m] = true;
			prev_mod[new_m] = m;
			digit_count[new_m] = digit_count[m] + 1;
			digit[new_m] = d;
			found_0 = new_m == 0;
		};
		visit(0);
		visit(1);
	}
}

int main() {
	int a, b;
	in >> a >> b;
	int lcm = a / gcd(a, b) * b;
	bfs(lcm);
	int i = digit_count[0];
	for (int m = 0; m != -1; m = prev_mod[m]) {
		ans[--i] = digit[m];
	}
	for (int i = 0; i < digit_count[0]; ++i) {
		out << ans[i];
	}
	out << "\n";
}