#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
char a[100000],b[100000];
int c[100000],a1[100000],b1[100000];
int main()
{
while(~scanf("%s %s",&a,&b))
{
if(a[0]=='0'||b[0]=='0')
{
printf("0\n");
continue;
}
int len1=strlen(a);
int len2=strlen(b);
int i,j;
for(i=0,j=len1-1;i<len1;i++,j--)
a1[j]=a[i]-'0';
for(i=0,j=len2-1;i<len2;i++,j--)
b1[j]=b[i]-'0';
memset(c,0,sizeof(c));
for(i=0;i<len1;i++)
{
for(j=0;j<len2;j++)
c[i+j]+=a1[i]*b1[j];
}
int len=max(len1,len2);
int t=0;
for(i=0;i<2*len;i++)
{
c[i]=c[i]+t;
t=c[i]/10;
c[i]%=10;
}
for(i=2*len;i>=0;i--)
{
if(c[i]!=0)
break;
}
for(;i>=0;i--)
printf("%d",c[i]);
printf("\n");
}
return 0;
}