#include <stdio.h>

#define same(a,b) ((a)-(b)<1e-6&&(b)-(a)<1e-6)

#define M 110

long double posl[M],p[M],p1[M],C;
long double ps[M][M];
int nps[M];

long double value(long double v)
 {
 int i;
 long double av=0;
 for (i=M-1;i>=0;i--)
  av=v*av+p[i];
 return av;
 }

long double fakt[M];

long double cvalue(long double what,int po)
 {
 return what/fakt[po];
 }

void nas(long double *pol,long double nik)
 {
 int i;
 for (i=nik+1;i>0;i--) pol[i]=pol[i-1];
 pol[0]=0;
 for (i=0;i<=nik;i++) pol[i]-=nik*pol[i+1];
 }

void sum(long double *pol,long double *pol1,long double C,int k)
 {
 int i;
 for (i=0;i<k;i++) pol[i]+=C*pol1[i];
 }

#define round(x) ((int) (x+0.5))

int main(void)
 {
 int n,s,c,i,j;
 fakt[0]=1;
 for (j=0;j<M;j++) ps[0][j]=0;
 ps[0][0]=1;nps[0]=1;
 for (i=1;i<M-1;i++)
  {
  nps[i]=i+1;
  for (j=0;j<M;j++) ps[i][j]=ps[i-1][j];
  nas(ps[i],i);
  }
 for (i=1;i<M;i++) fakt[i]=fakt[i-1]*i;
 scanf("%d",&n);
 while (n--)
  {
  scanf("%d%d",&s,&c);
  for (i=0;i<M;i++) p[i]=p1[i]=0;
  for (i=0;i<s;i++) scanf("%Lf",posl+i);
  p1[0]=1;
  p[0]=posl[0];
  for (i=1;i<s;i++)
   {
   if (!same(value(i+1),posl[i]))
    {
    C=cvalue(posl[i]-value(i+1),i);
    sum(p,ps[i],C,i+1);
    }
   }
  for(;i<s+c-1;i++) printf("%d ",round(value(i+1)));
  printf("%d\n",round(value(s+c)));
  }
 return 0;
 }