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

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

struct segtree {
  struct node {
    int add = 0;
    pair<int, int> mx = {0, 0};
  };

  int n;
  vector<node> tree;

  segtree(int _n = 0) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    tree.resize(2 * n);
    for (int i = n - 1; i >= 0; i--) {
      tree[n + i].mx.second = i;
    }
  }

  node join(const node& a, const node& b) {
    node res;
    res.mx = max(a.mx, b.mx);
    return res;
  }

  void push(int u, int) {
    for (int v : {2 * u, 2 * u + 1}) {
      tree[v].mx.first += tree[u].add;
      tree[v].add += tree[u].add;
    }
    tree[u].add = 0;
  }

  template<typename F>
  void run(int u, int ul, int ur, int l, int r, bool mod, F&& f) {
    if (ul >= l && ur <= r) {
      f(u, ur - ul + 1);
      return;
    }
    if (ul > r || ur < l) {
      return;
    }
    push(u, ur - ul + 1);
    int mid = (ul + ur) / 2;
    run(2 * u, ul, mid, l, r, mod, f);
    run(2 * u + 1, mid + 1, ur, l, r, mod, f);
    if (mod) {
      tree[u] = join(tree[2 * u], tree[2 * u + 1]);
    }
  }

  node get(int l, int r) {
    node res;
    run(1, 0, n - 1, l, r, false, [&] (int u, int) {
      res = join(res, tree[u]);
    });
    return res;
  }

  void modify(int l, int r, int a) {
    run(1, 0, n - 1, l, r, true, [&] (int u, int) {
      tree[u].add += a;
      tree[u].mx.first += a;
    });
  }
};

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];
    }
    segtree tree(n);
    vector<vector<int>> b(n);
    int inv = 0;
    for (int i = 0; i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        if (a[i] > a[j]) {
          b[i + 1].push_back(j);
          tree.modify(i + 1, j, 1);
          inv++;
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < k; i++) {
      auto [mx, p] = tree.get(0, n - 1).mx;
      ans += mx;
      for (int j = p; j >= 0; j--) {
        while (!b[j].empty()) {
          int r = b[j].back();
          if (r >= p) {
            tree.modify(j, r, -1);
            b[j].pop_back();
          } else {
            break;
          }
        }
      }
    }
    cout << inv - ans << '\n';
  }
}