#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

using namespace std;

const double PI=acos(-1.0);

struct Complex

{

    double r,i;

    Complex(){}

    Complex(double _r,double _i){r=_r;i=_i;}

    friend Complex operator + (const Complex &x,const Complex &y){return Complex(x.r+y.r,x.i+y.i);}

    friend Complex operator - (const Complex &x,const Complex &y){return Complex(x.r-y.r,x.i-y.i);}

    friend Complex operator * (const Complex &x,const Complex &y){return Complex(x.r*y.r-x.i*y.i,x.i*y.r+x.r*y.i);}

}a[],b[];

int n,m;

int R[];

void fft(Complex *y,int len,int on)

{

    for(int i=;i<len;i++) if(i<R[i]) swap(y[i],y[R[i]]);

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

    {

        Complex wn(cos(PI/i),sin(on*PI/i));

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

        {

            Complex w(,);

            for(int k=;k<i;k++,w=w*wn)

            {

                Complex u=y[j+k];

                Complex v=w*y[j+k+i];

                y[j+k]=u+v;

                y[j+k+i]=u-v;

            }

        }

    }

    if(on==-) for(int i=;i<len;i++) y[i].r/=len;

}

void calc()

{

    m+=n;

    int L=;

    for(n=;n<=m;n<<=) L++;

    for(int i=;i<n;i++) R[i]=(R[i>>]>>)|(i&)<<(L-);

    fft(a,n,);

    fft(b,n,);

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

    fft(a,n,-);

}

char st[];

int d[];

int main()

{

    scanf("%s",st+);

    n=strlen(st+);n--;

    for(int i=;i<=n;i++) a[i].r=double(st[i+]-'');

    scanf("%s",st+);

    m=strlen(st+);m--;

    for(int i=;i<=m;i++) b[i].r=double(st[i+]-'');

    calc();

    for(int i=;i<=m;i++) d[i]=int(a[m-i].r+0.5);

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

    {

        d[i+]+=d[i]/;

        d[i]%=;

    }

    int i=m;

    while(d[i+]!=)

    {

        i++;

        d[i+]+=d[i]/;

        d[i]%=;

    }

    m=i;

    for(int i=m;i>=;i--) printf("%d",d[i]);

    printf("\n");

    return ;

}