Given an integer array arr of size N and two integers K and M, the task is to find M largest sums of K sized subarrays.
1. The first line of the input contains a single integerT denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains three integers N, K, and M.
3. The next line contains N space-separated integers.
Output: For each test case, print M space-separated integers (Print the sums from the maximum to minimum)
1. 1 <= T <= 100 2. 1 <= K <= N <= 104
3. 1 <= M <= N - K + 1
4. 1 <= arr[i] <= 105