#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


constexpr Int INF = 1001001001001001001LL;

int N, K;
vector<Int> A;

Int solve() {
  priority_queue<Int> que;
  Int ret = 0;
  for (int i = 0; i < N; ++i) {
    que.push(A[i]);
    que.push(A[i]);
    ret += (que.top() - A[i]);
    que.pop();
  }
  return ret;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &N, &K);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    Int ans = INF;
    if (K == 1) {
      ans = solve();
    } else if (K == N) {
      for (int i = 0; i < N; ++i) {
        chmin(ans, solve());
        rotate(A.begin(), A.begin() + 1, A.end());
      }
    } else if (K % 2 != 0) {
      vector<int> is(N);
      for (int i = 0; i < N; ++i) is[i] = i;
      sort(is.begin(), is.end(), [&](int i, int j) -> bool {
        return (A[i] < A[j]);
      });
      int sig = N;
      uf.assign(N, -1);
      for (int i = 0; i < N; ++i) {
        if (connect(i, is[i])) {
          --sig;
        }
      }
// cerr<<"is = "<<is<<", sig = "<<sig<<endl;
      sig %= 2;
      if (sig) {
        for (int i = 0; i < N - 1; ++i) {
          chmin(ans, A[is[i + 1]] - A[is[i]]);
        }
      }
    } else {
      ans = 0;
    }
    printf("%lld\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}