#include <iostream>
#include <vector>
#include <string>
using namespace std;
//大数相乘
/**
*num1 乘数1
*num2 乘数2
*return 结果字符串
*/
string BigMutiple(string num1, string num2){string res="";//两个数的位数int m = num1.size(), n = num2.size();//一个i位数乘以一个j位数，结果至少是i+j-1位数vector<long long> tmp(m + n - 1);//每一位进行笛卡尔乘法for (int i = 0; i < m; i++){int a = num1[i] - '0';for (int j = 0; j < n; j++){int b = num2[j] - '0';tmp[i + j] += a*b;}}//进行进位处理，注意左侧是大右侧是小int carry = 0;for (int i = tmp.size() - 1; i >= 0; i--){int t = tmp[i] + carry;tmp[i] = t % 10;carry = t / 10;}//若遍历完仍然有进位while (carry != 0){int t = carry % 10;carry /= 10;tmp.insert(tmp.begin(), t);}//将结果存入到返回值中for (auto a : tmp){res = res + to_string(a);}if(res.size()>0&&res[0]=='0')return "0";return res;}//测试函数
int main(){string num1, num2;while (cin >> num1 >> num2){cout << BigMutiple(num1, num2) << endl;}return 0;
}