#include<iostream>
using namespace std;

#define NMAX 10000001

bool valid(int N)
{
	while(N > 0)
	{
		if(N % 10 > 1)
			return false;
		N /= 10;
	}
	return true;
}

int main()
{
	int numere[1000] = {1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11000, 11001, 11010, 11011, 11100, 11101, 11110, 11111, 100000, 100001, 100010, 100011, 100100, 100101, 100110, 100111, 101000, 101001, 101010, 101011, 101100, 101101, 101110, 101111, 110000, 110001, 110010, 110011, 110100, 110101, 110110, 110111, 111000, 111001, 111010, 111011, 111100, 111101, 111110, 111111, 1000000, 1000001, 1000010, 1000011, 1000100, 1000101, 1000110, 1000111, 1001000, 1001001, 1001010, 1001011, 1001100, 1001101, 1001110, 1001111, 1010000, 1010001, 1010010, 1010011, 1010100, 1010101, 1010110, 1010111, 1011000, 1011001, 1011010, 1011011, 1011100, 1011101, 1011110, 1011111, 1100000, 1100001, 1100010, 1100011, 1100100, 1100101, 1100110, 1100111, 1101000, 1101001, 1101010, 1101011, 1101100, 1101101, 1101110, 1101111, 1110000, 1110001, 1110010, 1110011, 1110100, 1110101, 1110110, 1110111, 1111000, 1111001, 1111010, 1111011, 1111100, 1111101, 1111110, 1111111, 10000000, 10000001};
	freopen("multiplu.in", "r", stdin);
	freopen("multiplu.out", "w", stdout);

	int primul_nr, al_doilea_nr;

	cin >> primul_nr >> al_doilea_nr;

	int nr = 0;
	for(int i = 0; i < 129; ++i)
	{
		if(numere[i] % primul_nr == 0 && numere[i] % al_doilea_nr == 0)
		{
			cout << numere[i] << endl;
			break;
		}
	}

	return 0;
}