#include <bits/stdc++.h>

using namespace std;

const int maxn = 5000;

int a[maxn], b[maxn];

int tmp[2*maxn];

signed main()
{
    string s1, s2;

    cin >> s1 >> s2;

    int lena = s1.length(), lenb = s2.length();

    for(int i = lena - 1; i >= 0; i--)
    {
        a[i] = s1[lena - i - 1] - '0';
    }
    for(int i = lenb - 1; i >= 0; i--)
    {
        b[i] = s2[lenb - 1 - i] - '0';
    }

    for(int i = 0; i < lenb; i++)
    {
        for(int j = 0; j < lena; j++)
        {
            tmp[i + j] += (a[j] * b[i]);
        }
    }

    int lenc = lena + lenb;

    for(int i = 0; i < lenc; i++)
    {
        int t = tmp[i];
        tmp[i] = t % 10;
        tmp[i+1] += t / 10;
    }
    while (lenc > 0 && tmp[lenc] == 0)
    {
        lenc--;
    }
    
    for(int i = lenc; i >= 0; i--)
    {
        cout << tmp[i];
    }
}