#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 2137
#endif

const int INF = 1e9;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    int inv = 0;
    vector<vector<int>> e(n);
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (a[j] < a[i]) {        
          inv++;
          e[i + 1].push_back(inv);
          e[j].push_back(-inv);
        }
      }
    }
    vector<int> vis(inv + 1, -1);
    vector<vector<int>> c(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
      int cnt = 0;
      for (int j = i; j < n; j++) {
        for (int x : e[j]) {
          if (x > 0) {
            vis[x] = i;
          } else if (x < 0 && vis[-x] == i) {
            cnt++;
          }
        }
        c[i][j] = cnt;
      }
    }
    if (k == 0) {
      cout << inv << '\n';
      continue;
    }
    auto f = [&] (pair<int, int> x, int j) {
      return x.first + (j - 1 >= x.second + 1 ? c[x.second + 1][j - 1] : 0);
    };
    vector<int> dp(n);
    for (int i = 1; i < n; i++) {
      dp[i] = c[0][i - 1];
    }
    for (int i = 1; i < k; i++) {
      vector<int> ndp(n);
      deque<pair<int, int>> q;
      q.push_back({dp[0], 0});
      for (int j = 1; j < n; j++) {
        while ((int)q.size() > 1 && f(q[1], j) < f(q[0], j)) {
          q.pop_front();
        }
        ndp[j] = f(q[0], j);
        while (!q.empty() && q.back().first >= dp[j]) {
          q.pop_back();
        }
        q.push_back({dp[j], j});
      }
      swap(dp, ndp);
    }
    int ans = INF;
    for (int i = 0; i < n; i++) {
      ans = min(ans, dp[i] + (i < n - 1 ? c[i + 1][n - 1] : 0));
    }
    cout << ans << '\n';
  }
}