#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll N=1E2+;

ll dp[N][N];

void solve(int t){

//    memset(dp,0,sizeof dp);

    ll n,c;

    cin>>n>>c;

    for(ll i=;i<=n;i++) cin>>dp[][i];

    if(n==) {

        cout<<dp[][];

        for(ll i=;i<=c;i++) cout<<" "<<dp[][];

        cout<<endl;

        return ;

    }

    ll pos=;

    while(){

        bool flag = false ;

        for(ll i=;i<=n-pos+;i++){

            dp[pos][i]=dp[pos-][i+]-dp[pos-][i];

        }

        if(pos==n) break;

        pos++;

    }

    for(ll i=;i<=c;i++){

        dp[n][i+]=dp[n][i];

        for(ll j=n-;j>=;j--){

            dp[j][n+i+-j]=dp[j][n+i-j]+dp[j+][n+i-j];

        }

        if(i==) cout<<dp[][n+i];

        else cout<<" "<<dp[][n+i];

    }

    cout<<endl;

}

int main(){

    ll t;

    cin>>t;

    for(int i=t;i>=;i--) solve(i);

    return ;

}