#include<bits/stdc++.h>

using namespace std;

string A, B;
map<int, int> ma;
int main(){
	cin >> A >> B;
	long long int a = A.size(), b = B.size();
	int t, temp, m = 0, q = 0;
	long long int count;
	for(long long int i = b - 1; i >= 0; i --){
		count = b - 1 - i;
		for(long long int j  = a - 1; j >= 0; j --){
			temp = (int)((A[j] - '0') * (B[i] - '0'));
			t = (temp + m + q) % 10;
			m = (temp + m + q) / 10;
			temp = ma[count] + t;
			ma[count ++] = temp % 10;
			q = temp / 10;  
		}
		while(ma[count] + m + q > 10){
			temp = ma[count] + m + q;
			ma[count ++] = temp % 10;
			m = 0;
			q = temp / 10;
		}
		if(ma[count] + q + m > 0){
			ma[count] = ma[count] + m + q;
			m = 0;
		}
		q = 0;
	}
	long long int i = ma.size() - 1;
	while(ma[i] == 0 && i > 0)i--;
	while(i >= 0)cout << ma[i--];
	return 0;
}