有时间改个万进制(其实也就是读入麻烦了一点)
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<vector>
#include<ctime>
#define ll long long
#define inf 2e8
#define clr(x) memset(x,0,sizeof(x))
#define maxen(x) memset(x,127,sizeof(x))
#define maxer(x) memset(x,31,sizeof(x))
#define minus(x) memset(x,-1,sizeof(x))
#define each(i,n,m) for(int i=n;i<m;i++)
#define eachrev(i,n,m) for(int i=n;i>m;i--)
#define minn(a,b,c) min(a,min(b,c))
#define maxx(a,b,c) max(a,max(b,c))
#ifdef WIN32
#define lld "%I64d"
#else
#define lld "%lld"
#endif
#define PROC "thuuu"
//for(int i=1;i<=n;i++)
//(double) (ll) LL (int)
//(double)clock()/CLOCKS_PER_SEC
using namespace std;
const int modd=1e9+7;
const int Maxn=5e3+5;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct BigItr
{
int len,s[Maxn];
bool minu;
BigItr(){len=1;minu=false;clr(s);};
bool operator < (const BigItr&x)const {
if(len!=x.len)return len<x.len;
for(int i=len;i>=1;i--)
if(s[i]!=x.s[i])return s[i]<x.s[i];
return false;
}
bool operator>(const BigItr &x)const {return x<*this;};
bool operator<=(const BigItr &x)const {return x>*this;};
bool operator>=(const BigItr &x)const {return x<*this;};
bool operator==(const BigItr &x)const {return (!(x<*this))&&(!(x>*this));};
bool operator!=(const BigItr &x)const {return !(x==*this);};
BigItr operator=(const char* num){
len=strlen(num);
if(num[0]=='-'){
minu=true;
len--;
for(int i=1;i<=len;i++)
s[i]=num[len-i+1]-'0';
return *this;
}
for(int i=1;i<=len;i++)
s[i]=num[len-i]-'0';
return *this;
}
//BigItr operator-(const BigItr a);
BigItr operator+(BigItr a){
BigItr c;
if(minu&&a.minu)c.minu=true;
else if(minu){minu=false;c=a-*this;minu=true;return c;}
else if(a.minu){a.minu=false;return c=*this-a;};
c.len=max(len,a.len)+1;
for(int i=1,x=0;i<=c.len;i++){
c.s[i]=s[i]+a.s[i]+x;
x=c.s[i]/10;
c.s[i]%=10;
}
if(!c.s[c.len])c.len--;
return c;
}
BigItr operator-(BigItr a){
BigItr c;
if(minu&&a.minu){
minu=false;
a.minu=false;
c=a-*this;
c.minu=true;
minu=true;
return c;
}
else if(minu){
minu=false;
c=a+*this;
c.minu=true;
minu=true;
return c;
}
else if(a.minu){
a.minu=false;
return c=*this+a;
}
c.len=max(len,a.len);
if(*this<a){
c=a-*this;
c.minu=true;
return c;
}
for(int i=1;i<=c.len;i++){
c.s[i]+=s[i]-a.s[i];
if(c.s[i]>=0)continue;
c.s[i]+=10;
c.s[i+1]--;
}
while((!c.s[c.len])&&c.len)c.len--;
return c;
}
BigItr operator*(BigItr a){
BigItr c;
if(minu&&a.minu);
else if(minu)c.minu=true;
else if(a.minu)c.minu=true;
c.len=len+a.len;
for(int i=1,x=0;i<=len;i++,x=0){
for(int j=1;j<=a.len;j++){
c.s[i+j-1]+=s[i]*a.s[j]+x;
x=c.s[i+j-1]/10;
c.s[i+j-1]%=10;
}
c.s[i+a.len]=x;
}
while((!c.s[c.len])&&c.len)c.len--;
return c;
}
/*BigItr operator/(const BigItr&a){
BigItr c;
c.len=max(len,a.len)+1;
for(int i=1,x=0;i<=c.len;i++){
c.s[i]=s[i]+a.s[i]+x;
x=c.s[i]/10;
c.s[i]%=10;
c.s[i]=c.s[i]%10;
}
if(!c.s[c.len])c.len--;
return c;
}*/
BigItr (int num){*this=num;}
BigItr(const char num[]){*this=num;}
};
ostream& operator<<(ostream&out,const BigItr&x){
if(x.minu)printf("-");
for(int i=x.len;i>=1;i--)
printf("%d",x.s[i]);
if(!x.len)printf("0");
return out;
}
BigItr a,c,d;
char b[Maxn];
void init()
{
scanf("%s",b);
a=b;
scanf("%s",b);
c=b;
d=a*c;
cout<<d;
}
void work()
{
printf("");
}
void debug()
{
//
}
int main()
{
freopen(PROC".in","r",stdin);
freopen(PROC".out","w",stdout);
init();
work();
//debug();
return 0;
}