#include<bits/stdc++.h>

 using namespace std;

 const double pi = atan(1.0)*;

 const int N = 5e4 + ;

 typedef long long ll;

 struct Complex {

     double x,y;

     Complex(double _x=,double _y=)

         :x(_x),y(_y) {}

     Complex operator + (Complex &tt) { return Complex(x+tt.x,y+tt.y); }

     Complex operator - (Complex &tt) { return Complex(x-tt.x,y-tt.y); }

     Complex operator * (Complex &tt) { return Complex(x*tt.x-y*tt.y,x*tt.y+y*tt.x); }

 };

 Complex a[N*],b[N*];

 void fft(Complex *a, int n, int rev) {

     // n是(大于等于相乘的两个数组长度)2的幂次 ； 比如长度是5 ,那么 n = 8    2^2 < 5          2^3 > 5

     // 从0开始表示长度，对a进行操作

     // rev==1进行DFT，==-1进行IDFT

     for (int i = ,j = ; i < n; ++ i) {

         for (int k = n>>; k > (j^=k); k >>= );

         if (i<j) std::swap(a[i],a[j]);

     }

     for (int m = ; m <= n; m <<= ) {

         Complex wm(cos(*pi*rev/m),sin(*pi*rev/m));

         for (int i = ; i < n; i += m) {

             Complex w(1.0,0.0);

             for (int j = i; j < i+m/; ++ j) {

                 Complex t = w*a[j+m/];

                 a[j+m/] = a[j] - t;

                 a[j] = a[j] + t;

                 w = w * wm;

             }

         }

     }

     if (rev==-) {

         for (int i = ; i < n; ++ i) a[i].x /= n,a[i].y /= n;

     }

 }

 char s[N], t[N];

 int c[N*];

 int main(){

     /*a[0] = Complex(0,0); //  a[0]: x的0次项。

     a[1] = Complex(1,0);

     a[2] = Complex(2,0);

     a[3] = Complex(3,0);

     b[0] = Complex(3,0);

     b[1] = Complex(2,0);

     b[2] = Complex(1,0);

     b[3] = Complex(0,0);

     fft(a,8,1);

     fft(b,8,1);

     for(int i = 0 ; i < 8 ; i ++){

         a[i] = a[i] * b[i];

     }

     fft(a,8,-1);

     for(int i = 0 ; i < 8 ; i ++){

         cout << i << "   " << a[i].x << endl;;

     }*/

     while(scanf("%s%s",s,t) == )

     {

         int n = strlen(s), m = strlen(t);

         for(int i=;i<n;i++) a[i] = Complex(s[n-i-]-'', );

         for(int i=;i<m;i++) b[i] = Complex(t[m-i-]-'', );

         int len = n+m-;

         int LIM = ;

         while(LIM < len) LIM <<= ;

         for(int i=n;i<LIM;i++) a[i] = Complex(, );

         for(int i=m;i<LIM;i++) b[i] = Complex(, );

         fft(a, LIM, );

         fft(b, LIM, );

         for(int i=;i<LIM;i++) a[i] = a[i] * b[i];

         fft(a, LIM, -);

         memset(c, , sizeof c);

         for(int i=;i<len-;i++)

         {

             c[i] += (int)(a[i].x + 0.1);

             c[i+] += c[i] / ;

             c[i] %= ;

         }

         c[len-] += (int)(a[len-].x + 0.1);

         if(c[len-] > )

         {

             c[len] = c[len-] / ;

             c[len-] %= ;

             len++;

         }

         for(int i=len-;i>;i--) if(c[i] == ) len--; else break; // 0 * 345 = 0 instead of 000

         for(int i=;i<len/;i++) swap(c[i], c[len-i-]);

         for(int i=;i<len;i++) printf("%d",c[i]);

         puts("");

     }

     return ;

 }