#include <stdio.h>
#include <algorithm> 
int e[100];
void precalcul()
{
	e[2]=10;
	e[4]=100;
	e[5]=101;
	e[6]=110;
	e[8]=1000;
	e[9]=1001;
	e[10]=1010;
	e[11]=1100;
	e[12]=1011;
	e[13]=1101;
	e[14]=1110;
	e[16]=10000;
	e[17]=10001;
	e[18]=10010;
	e[19]=10100;
	e[20]=11000;
	e[21]=10011;
	e[22]=10101;
	e[23]=11001;
	e[24]=10110;
	e[25]=11010;
	e[26]=11100;
	e[27]=10111;
	e[28]=11011;
	e[29]=11101;
	e[30]=11110;
	e[32]=100000;
	e[33]=100001;
	e[34]=100010;
	e[35]=100100;
	e[36]=101000;
	e[37]=110000;
	e[38]=100011;
	e[39]=100101;
	e[40]=101001;
	e[41]=110001;
	e[42]=100110;
	e[43]=101010;
	e[44]=110010;
	e[45]=101100;
	e[46]=110100;
	e[47]=111000;
	e[48]=100111;
	e[49]=101011;
	e[50]=110011;
	e[51]=101110;
	e[52]=110110;
	e[53]=111010;
	e[54]=111100;
	e[55]=101111;
	e[56]=110111;
	e[57]=111011;
	e[58]=111101;
    e[59]=111110;
	e[61]=1000000;
	e[62]=1000001;
	e[63]=1000010;
	e[64]=1000100;
	e[65]=1001000;
	e[66]=1010000;
	e[67]=1100000;
	
	
	e[68]=1111110;
}
using namespace std;   
int main()
{
	freopen("multiplu.in","r",stdin);
	freopen("multiplu.out","w",stdout);
	int a,b,i,j;
	precalcul();
    sort (e+1, e+100+1);   
	scanf("%d%d",&a,&b);
	for (i=1; i<=68; i++)
		if (e[i])
			if (e[i]%a==0 && e[i]%b==0)
			{
				printf("%d",e[i]);
				break;
			}
	return 0;
}