同2510
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 1010
#define MAXM 1010
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
int n;
struct mat{
double x[MAXN];
mat(){
int i;
for(i=0;i<MAXN;i++){
x[i]=0;
}
}
friend mat operator *(mat x,mat y){
mat z;
int i,j;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
z.x[i]+=x.x[j]*(y.x[(i-j+n)%n]);
}
}
return z;
}
};
int m,k;
mat a,b,c;
int main(){
int i;
scanf("%d%d%d",&n,&m,&k);
if(n==1){
printf("%.3lf\n",1.0*m);
return 0;
}
for(i=1;i<=n;i++){
scanf("%lf",&a.x[i-1]);
}
b.x[0]=1;
c.x[0]=-1.0/m+1;
c.x[1]=1.0/m;
while(k){
if(k&1){
b=b*c;
}
c=c*c;
k>>=1;
}
a=a*b;
for(i=0;i<n;i++){
printf("%.3lf\n",a.x[i]);
}
return 0;
}
/*
2 3 2
3 0
*/