#include "bits/stdc++.h"
#include "bits/extc++.h"

using namespace std;
using namespace __gnu_pbds;

#define fwd(i,a,b) for(int i=(a); i<(b);i++)
#define ford(i,a,b) for(int i=(a); i>(b); i--)
#define rep(i,n) fwd(i,0,n)

template<typename T>
using TreeLess = tree <T,  null_type,  greater<T>,  rb_tree_tag,  tree_order_statistics_node_update>;
template<typename T>
using TreeHigh = tree <T,  null_type,  less<T>,  rb_tree_tag,  tree_order_statistics_node_update>;

#define DEBUG

#ifdef DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& out, const pair<T1, T2>& a) { return out << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename N> auto& operator<<(N& out, const T& a) { out << "{"; for (const auto& b : a) out << b << ", "; return out << "}"; }
template<typename... Args> void print(Args&&... args) { (cerr << ... << args) << "\n"; }
#define debug(x...) cerr << "[" #x "]: ", print(x)
#else
#define debug(...) ;
#endif

int main() {
    ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);

    int t, n, k, ans, c;
    cin >> t;
    while(t--) {
        cin >> n >> k;
        ans = 0;

        vector<int> D(n);
        vector<vector<int>> S(n, vector<int>(n)), B(n, vector<int>(n));

        rep(i, n) cin >> D[i];
        rep(i, n) {
            c = 0;
            fwd(j, i+1, n) {
                if(D[i] > D[j]) {
                    ans++; c++;
                }
                S[i][j] = c;
            }
            c = 0;
            ford(j, i, -1) {
                if(D[j] > D[i]) c++;
                B[i][j] = c;
            }
            B[i][n-1] = c;
        }

        int sum, maxv, maxi, imin, imax;
        TreeLess<int> dtree;
        TreeHigh<int> utree;
        set<int> skey;
        dtree.insert(-1);
        utree.insert(n-1);
        rep(z, k) {
            maxv = 0;
            sum = 0;
            rep(i, n) {
                sum -= B[i][n-1];
                sum += S[i][n-1];
                if(sum > maxv && !skey.count(i)) {
                    maxi = i;
                    maxv = sum;
                }
            }
            skey.insert(maxi);
            ans -= maxv;

            imin = *dtree.find_by_order(dtree.order_of_key(maxi));
            imax = *utree.find_by_order(utree.order_of_key(maxi+1));
            ford(i, maxi, imin) S[i][n-1] = S[i][maxi];
            fwd(i, maxi+1, imax+1) B[i][n-1] = S[i][maxi+1];
            dtree.insert(maxi); utree.insert(maxi);
        }
        cout << ans << '\n';
    }

    return 0;
}