#include
#include
#include
using namespace std;
const int maxn=211;
char a[maxn+1];
int ans[maxn+1],tmp[maxn+1];
int n;
int t1[maxn];
int muti(int ans[],int tmp[])
{
memset(t1,0,sizeof(t1));
for(int i=1;i
for(int j=1;j
{
t1[i+j-1]+=ans[i]*tmp[j];
//
printf("%d\n",t1[i+j-1]);
}
for(int i=1;i
{
t1[i+1]+=t1[i]/10;
t1[i]%=10;
}
for(int i=1;i
ans[i]=t1[i];
}
int main()
{
while(scanf("%s %d",&a[1],&n)!=EOF)
{
memset(tmp,0,sizeof(tmp));
memset(ans,0,sizeof(ans));
int lon=strlen(&a[1]);
for(int i=1,j=1;i<=lon;i++,j++)
{
if(a[i]!='.')
tmp[j]=a[i]-'0';
else
j--;
}
for(int i=1;i
ans[lon-i]=tmp[i];
for(int i=1;i
tmp[i]=ans[i];
for(int i=1;i
muti(ans,tmp);
int k1,t,k2;
for(int i=maxn-1;;i--)
if(ans[i]>0)
{
k1=i;
break;
}
for(int i=0;;i++)
if(ans[i]>0)
{
k2=i;
break;
}
for(int i=1;i<=strlen(&a[1]);i++)
if(a[i]=='.')
{
t=strlen(&a[1])-i;
break;
}
t*=n;
for(int i=k1;i>t;i--)
printf("%d",ans[i]);
if(t>=k2)
printf(".");
for(int i=t;i>=k2;i--)
printf("%d",ans[i]);
printf("\n");
}
return 0;
}