#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);
        }
      }
    }
    if (k == 0) {
      cout << inv << '\n';
      continue;
    }
    vector<vector<int>> c(n, vector<int>(n));
    for (int i = 0; i < n; i++) {
      set<int> s;
      int cnt = 0;
      for (int j = i; j < n; j++) {
        for (int x : e[j]) {
          if (x > 0) {
            s.insert(x);
          } else if (x < 0 && s.count(-x)) {
            s.erase(-x);
            cnt++;
          }
        }
        c[i][j] = cnt;
      }
    }
    vector<int> dp1(n), dp2(n);
    auto solve = [&] (auto self, int l, int r, int kl, int kr) -> void {
      if (l > r) {
        return;
      }
      int mid = (l + r) / 2;
      int mnv = INF;
      int mnk = 0;
      for (int i = kl; i <= min(mid - 1, kr); i++) {
        int v = dp1[i] + (mid - 1 >= i + 1 ? c[i + 1][mid - 1] : 0);
        if (v < mnv) {
          mnv = v;
          mnk = i;
        }
      }
      dp2[mid] = mnv;
      self(self, l, mid - 1, kl, mnk);
      self(self, mid + 1, r, mnk, kr);
    };  
    for (int i = 1; i < n; i++) {
      dp1[i] = c[0][i - 1];
    }
    for (int i = 1; i < k; i++) {
      solve(solve, 0, n - 1, 0, n - 1);
      swap(dp1, dp2);
    }
    int ans = INF;
    for (int i = 0; i < n; i++) {
      ans = min(ans, dp1[i] + (i < n - 1 ? c[i + 1][n - 1] : 0));
    }
    cout << ans << '\n';
  }
}