#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
string a,b;
int lena,lenb,lenc,a1[N],b1[N],c1[N],x;
int main(){
	cin>>a>>b;
	lena=a.size();
	lenb=a.size();
	for(int i=0;i<lena;i++){
		a1[i]=a[lena-i-1]-'0';
	}
	for(int i=0;i<lenb;i++){
		b1[i]=b[lenb-i-1]-'0';
	}
	for(int i=0;i<lenb;i++){
		x=0;
		for(int j=0;j<lena;j++){
			c1[i+j]+=a1[j]*b1[i]+x;
			x=c1[i+j]/10;
			c1[i+j]%=10;
		}
		c1[lena+i]=x;
	}
	lenc=lena+lenb;
	while(c1[lenc]==0&&lenc>0){
		lenc--;
	}
	for(int i=lenc;i>=0;i--){
		cout<<c1[i];
	}
return 0;
}