#include<bits/stdc++.h>
#define maxn 20005
using namespace std;
typedef long long ll;
ll a[maxn],b[maxn];
string aa,bb;
ll z[maxn * 2 + 5];
int main()
{
cin >> aa >> bb;
ll n = aa.length();
ll m = bb.length();
for(int i = 0; i < n; i ++)a[i] = (aa[n-i-1] - '0');
for(int i = 0; i < m; i ++)b[i] = (bb[m-i-1] - '0');
for(int i = 0; i < n; i ++)
{
for(int j = 0; j < m; j ++)
{
z[i+j] += a[i] * b[j];
}
}
ll len;
len = max(n,m) * 2;
for(int i = 0; i < len; i ++)
{
if(z[i] > 9)
{
z[i+1] += z[i] / 10;
z[i] = z[i] % 10;
}
}
while(z[len] == 0 && len > 0)len--;
if(len == 0)cout << 0 << endl;
else
{
for(int i = len; i >= 0; i --)
{
cout << z[i];
}
cout << endl;
}
return 0;
}