#include<iostream>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
#define LL long long
#define MOD 1000000007
LL tt,n,t,k,a[10010];
LL poww(LL x,LL y)
{
      LL ans=1;
      while(y>0)
      {
            if(y&1)
                  ans=ans*x%MOD;
            x=(x*x)%MOD;
            y=y>>1;
      }
      return ans%MOD;

}

int main()
{
      scanf("%I64d",&tt);
      while(tt--)
      {
            scanf("%I64d%I64d%I64d",&n,&t,&k);
            LL mul;
            mul=poww(k,t);
            for(int i=0;i<n;i++)
            {
                  scanf("%I64d",&a[i]);
                  a[i]=a[i]*mul%MOD;
            }
            t=t%n;
            printf("%d",a[(n+0-t)%n]);
            for(int i=1;i<n;i++)
                  printf(" %d",a[(n+i-t)%n]);
            printf("\n");
      }
      return 0;
}