ll a[MAX];
ll dp[MAX][MAX];
const ll INF = 1e15;

int main(){
    int t;
    scanf("%d",&t);

    for(int cs=1;cs<=t;cs++){
        int n,z;
        scanf("%d %d",&n,&z);

        for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
        sort(a+1,a+n+1);
        reverse(a+1,a+n+1);

        dp[0][0] = 0;
        for(int pos=1; pos<=n; pos++) dp[0][pos] = INF;

        for(int used=1; used<=z; used++){
            dp[used][0] = INF;
            for(int pos=1; pos<=n; pos++){
                ll Curr = INF;
                for(int last=0; last<pos; last++){
                    Curr = min(Curr, dp[used-1][last] - last*a[pos]);
                }
                Curr += pos*a[pos];
                dp[used][pos] = Curr;
            }
        }

        ll Ans = INF;
        for(int pos=1; pos<=n; pos++) Ans = min(Ans, dp[z][pos]);
        printf("%lld\n",Ans);
    }
}

const int N          = (int)1e3 + 5 ;
#define     Int         Int()
int dp[N][N], a[N] ;

int main(){
    int test = Int , tc = 0 ;
    while(test--){
        int n = Int, z = Int ;
        for(int i = 1 ; i <= n ; ++i){
            a[i] = Int ;
            dp[0][i] = 0 ;
        }
        sort(a + 1, a + n + 1) ;
        for(int i = 1 ; i <= n ; ++i){
            dp[1][i] = a[i] * (n - i + 1) ;
        }
        for(int i = 2 ; i <= z ; ++i){
            for(int j = i - 1 ; j <= n ; ++j){
                int x = inf ;
                for(int k = i - 1 ; k < j ; ++k){
                    x = min(x, dp[i - 1][k] + ((a[j] - a[k]) * (n - j + 1))) ;
                }
                dp[i][j] = x ;
            }
        }
        int res = inf ;
        for(int i = z ; i <= n ; ++i){
            res = min(res, dp[z][i]) ;
        }
        printf("%d\n",res);
    }
    return 0 ;
}