1
2 1
-2 -3
 3
1 1
1
5 4
5 -1 4 2 0
1 2
69
 1
5 1
-5 -4 -3 -2 -1
 1
2 1
-6 -9
 1
1 398708496844866113
959414461
 1
2 1
-5 -4
 2
3 1
-1 -2 0
3 2
-1 -2 0
 1
5 1
-1 -2 -3 -4 -5
 1
2 1
-1000000000 -1000000000
 1
2 1
-199 -191
 1
1 1
-1000
 1
2 1
-5 -5
 1
5 5
-999999995 -999999996 -999999997 -999999998 -999999999
 1
3 1
-4 -5 -6
 1
1 1
-1
 1
3 1
-3 -4 -5
 1
3 1
-1000000000 -1000000000 -1000000000
 1
2 1
-10 -11
 1
3 3
-100 -100 -100
 1
3 1
-1 -2 -3
 1
5 5
-10 -9 -8 -7 -6
 1
4 1
-1 -1 -1 -1
 1
2 1
-1 -2
 1
3 999
1000000000 -1000000000 -31
 5
20 809014
289 -254 1 -109 -167 93 23 -37 -31 -109 204 59 296 49 132 0 -28 35 -197 -266
20 458494
113 218 -292 -298 179 258 -257 -20 296 76 -145 93 -282 -261 -159 -45 255 -107 171 63
14 876161
69 74 12 2 177 -113 103 93 38 -48 282 169 205 145
26 731742
76 190 -227 -81 -293 243 -122 -122 252 16 -88 243 -216 -275 -267 188 144 -245 -117 -244 -259 281 -273 -206 112 -51
20 327039
42 133 231 128 19 181 -137 193 136 75 -203 55 37 -155 -219 182 -178 -280 2 132
 4
6 4
219 57 -58 230 173 177
2 4
266 176
3 2
134 -190 202
5 69
-1000000000 -1000000000 1000000000 0 1000000000
 1
5 1
-9 -8 -7 -6 -5
 1
3 1
-1 -4 -10
 1
5 3
-4 -5 -6 -7 -8
 1
2 3
-3 -3
 1
5 1000000000000000000
-5 -4 -3 -2 -1

0 1  
 0  
6 0 5 3 1  
0  
 4 3 2 1 0  
 0 3  
 0  
 1 0  
 1 2 0  
1 0 2  
 0 1 2 3 4  
 0 0  
 8 0  
 0  
 0 0  
 0 1 2 3 4  
 0 1 2  
 0  
 0 1 2  
 0 0 0  
 0 1  
 0 0 0  
 0 1 2  
 4 3 2 1 0  
 0 0 0 0  
 0 1  
 0 2000000000 1000000031  
 555 12 267 157 99 359 289 229 235 157 470 325 562 315 398 266 238 301 69 0  
411 516 6 0 477 556 41 278 594 374 153 391 16 37 139 253 553 191 469 361  
213 208 270 280 105 395 179 189 244 330 0 113 77 137  
369 483 66 212 0 536 171 171 545 309 205 536 77 18 26 481 437 48 176 49 34 574 20 87 405 242  
189 98 0 103 212 50 368 38 95 156 434 176 194 386 450 49 409 511 229 99  
 277 115 0 288 231 235  
90 0  
324 0 392  
2000000000 2000000000 0 1000000000 0  
 4 3 2 1 0  
 0 3 9  
 0 1 2 3 4  
 0 0  
 0 1 2 3 4  

// template halnix16


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Comparator;
import java.util.PriorityQueue;

public class Main {


    static BufferedReader br;

    public static void main(String[] args) throws Exception {
        // write your code here
        br = new BufferedReader(new InputStreamReader(System.in));

        int t = (int) in();
        while (t-- > 0) {

            long arr[] = arr(2);
            int n = (int)arr[0];
            long k = arr[1];
            arr = arr(n);
            PriorityQueue<data> priorityQueue = new PriorityQueue<>(n,new comp());
            for(int i =0;i<n;i++){
                priorityQueue.add(new data(arr[i],i));
            }
            int i =0;
            if(k>1){
                k=n;
            }
            while (i<k){

                long max= priorityQueue.peek().val;

                PriorityQueue<data>temp = new PriorityQueue<>(n,new comp());
                while (!priorityQueue.isEmpty()){
                    data data = priorityQueue.peek();
                    long v= data.val;
                    int index = data.index;
                    priorityQueue.poll();
                    System.out.print(v+" ");

                    temp.add(new data(max-v,index));
                }
                System.out.println();
                i++;
                priorityQueue.clear();;
                priorityQueue=temp;
            }
            long ans[] = new long[n];
            for(int j=0;j<n;j++){
                data data = priorityQueue.poll();
                long v= data.val;
                int index = data.index;
                ans[index]= v;

            }
            StringBuilder sb = new StringBuilder();
            for(int j=0;j<n;j++){
                sb.append(ans[j]+" ");

            }
            System.out.println(sb.toString());

        }
    }


    static long[] arr(long n) throws Exception {

        String read[] = sarrin();
        long arr[] = new long[(int) n];
        for (int k = 0; k < n; k++)
            arr[k] = in(read[k]);
        return arr;

    }

    static long[][] arr(long n, long m) throws Exception {


        long arr[][] = new long[(int) n][(int) m];
        for (int k = 0; k < n; k++) {
            String read[] = sarrin();
            for (int j = 0; j < m; j++)
                arr[k][j] = in(read[k]);
        }
        return arr;

    }

    static long in() throws Exception {
        return Long.parseLong(br.readLine());


    }

    static long in(String num) throws Exception {
        return Long.parseLong(num);


    }


    static String sin() throws Exception {

        return br.readLine();
    }

    static String[] sarrin() throws Exception {

        return br.readLine().split(" ");

    }

    static String[] regexSplit() throws Exception {
        return br.readLine().split(" ?(?<!\\G)((?<=[^\\p{Punct}])(?=\\p{Punct})|\\b) ?");
    }

    static int integer() throws Exception {
        return Integer.parseInt(br.readLine());
    }


}

class data{
    long val;
    int index;

    public data(long val, int index) {
        this.val = val;
        this.index = index;
    }
}
class comp implements Comparator<data>{


    @Override
    public int compare(data data, data t1) {
        if(data.val<t1.val){
            return 1;
        }else{
            return -1;
        }
    }
}