#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 const int Maxn=;

 int n,m,k;

 struct Matrix{double a[Maxn];}Ori,Bas,Ans;

 inline Matrix operator * (Matrix A,Matrix B)

 {

     Matrix C; memset(C.a,,sizeof(C.a));

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

         for (int j=;j<=n;j++) C.a[i]+=A.a[j]*B.a[(i-j+n+)%n==?n:(i-j+n+)%n];

     return C;

 }

 inline Matrix Pow(Matrix Base,int Exp)

 {

     Matrix Ret; memset(Ret.a,,sizeof(Ret.a)); Ret.a[]=;

     while (Exp)

     {

         if (Exp&) Ret=Ret*Base;

         Base=Base*Base; Exp>>=;

     }

     return Ret;

 }

 int main()

 {

     scanf("%d%d%d",&n,&m,&k);

     for (int i=;i<=n;i++) scanf("%lf",&Ori.a[i]);

     Bas.a[]=(double)(m-)/(double)m;

     Bas.a[]=/(double)m;

     Bas=Pow(Bas,k);

     Ans=Bas*Ori;

     for (int i=;i<=n;i++) printf("%.3lf\n",Ans.a[i]);

     return ;

 }