#include <fstream>
#include <string>
#include <bitset>
#include <queue>
#include <vector>
#include <algorithm>
#define DN 2000005

using namespace std;

bitset<DN> pos;
int parent[DN];
char digit[DN];

int gcd(int a, int b) {
	for(int r; b; r = a % b, a = b, b = r);
	return a;
}

int main() {
	int a, b;
	//freopen("input.txt", "r", stdin);
	ifstream fin("multiplu.in");
	ofstream fout("multiplu.out");
	fin >> a >> b;
	int lcm = a * b / gcd(a, b);
	pos[1] = 0;
	queue <int> q;
	q.push(1);
	digit[1] = 1;
	parent[1] = 0;

	int x, y, elem;
	while(!q.empty()) {
		elem = q.front();
		q.pop();
		x = (elem * 10) % lcm;
		if(!pos[x]){
			pos[x] = 1;
			digit[x] = '0';
			parent[x] = elem;
			if(x == 0)
				break;
			q.push(x);
		}
		y = x + 1;
		if(y >= lcm)
			y -= lcm;
		if(!pos[y]) {
			pos[y] = 1;
			digit[y] = '1';
			parent[y] = elem;
			if(y == 0)
				break;
			q.push(y);
		}
	}
	string res;
	int crt = 0;
	while(parent[crt] != 0) {
		res += digit[crt];
		crt = parent[crt];
	}
	res += '1';
	reverse(res.begin(), res.end());
	fout << res;
	return 0;
}