21816_GroupTrave

After finished the composition exam of GRE, Sigma and QK wanted to have a good rest, and then invented all member of ACM-BUAA team to go to a trip. After some hard work, they find a bus for vehicle in the trip.

Unfortunately, not all the people in ACM-BUAA team want to go to the same place, so the bus must parking at some place. But as we know, the traffic is always bad, so they decided only parking on some place.

You can assume all where they want to go is on positive number axis, and Beihang University is on the origin. There are N people on the ACM-BUAA team. The ith people want to the place pi. For some reason, they didn't want the number of parking times exceed K.

Because all of them are busy preparing the trip, when they realize the parking-problem, it's too late for them to coding. So they ask you for help, can you minimize the sum of the walking distance for all the people?

Input includes multiple cases.

First line is the number of case t.

For each case: The first line contain two integer number N, K ( 0 < K ≤ N ≤ 3000 ). The second line contains N numbers, which means p_i ( 0 ≤ p_i ≤ 10⁵ ) mentioned before.

For each case:

Output an integer number. It is the minimal sum of the walking distance for all the people.

2
3 1
1 11 21
6 2
1 2 4 11 12 14

20
6