#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>

using namespace std;

vector<int> arr;
int sum_cache[100][101];
int result_cache[11][101];

int min_square_sum(int start, int end) {
    int sum = 0;
    int& square_sum = sum_cache[start][end];
    if(square_sum != -1) {
        return square_sum;
    }
    square_sum = 0;
    for(int i=start; i<end; i++) {
        sum += arr[i];
    }
    int average = int(round(double(sum) / (end - start)));
    for(int i=start; i<end; i++) {
        square_sum += (average - arr[i]) * (average - arr[i]);
    }
    return square_sum;
}

int quantinize(int n, int s, int start) {
    if(s == 1)
        return min_square_sum(start, n);
    int& result = result_cache[s][start];
    if(result != -1)
        return result;
    result = 987654321;
    for(int i=start+1; i<=n-s+1; i++) {
        result = min(result, min_square_sum(start, i) + quantinize(n, s-1, i));
    }
    return result;
}

int main() {
    int c;
    cin >> c;
    for(int i=0; i<c; i++) {
        int n, s;
        cin >> n >> s;
        for(int j=0; j<n; j++) {
            int a;
            cin >> a;
            arr.push_back(a);
        }
        sort(arr.begin(), arr.end());
        memset(sum_cache, -1, 100*101*sizeof(int));
        memset(result_cache, -1, 11*101*sizeof(int));
        cout << quantinize(n, s, 0) << endl;
        arr.clear();
    }
}