**Compilation/Execution Result:**

Given an array, print k largest elements from the array. The output elements should be printed in decreasing order.

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N and k, N is the size of array and K is the largest elements to be returned.

The second line of each test case contains N input C[i].

**Output:**

Print the k largest element in descending order.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 100

K ≤ N

1 ≤ C[i] ≤ 1000

**Example:**

**Input:**

2

5 2

12 5 787 1 23

7 3

1 23 12 9 30 2 50

**Output:**

787 23

50 30 23

John Carey | 92 |

surbhi_7 | 90 |

mystery | 76 |

Ibrahim Nash | 74 |

Rajat Thakur 2 | 73 |

Ibrahim Nash | 588 |

ashrepos | 490 |

RealHorror | 364 |

shaktiman_shaktiman_shaktiman | 333 |

shi143din | 313 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2427 |

Michael Riegger | 2226 |

Jasleen Kaur 2 | 2012 |