#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, c;
    cin >> t;
    while(t--) {
        cin >> n >> k;
        vector<int> D(n), PL(n, 0), PR(n, n-1);
        rep(i,n) cin >> D[i];
        vector<vector<int>> L, R;
        L = R = vector<vector<int>>(n, vector<int>(n));
        rep(i,n) {
            c = 0;
            fwd(j, i, n) {
                if(D[i]>D[j]) c++;
                R[i][j] = c;
            }
            c = 0;
            ford(j, i, -1) {
                if(D[i]<D[j]) c++;
                L[i][j] = c;
            }
        }

        TreeHigh<int> thigh; thigh.insert(n-1);
        TreeLess<int> tlow; tlow.insert(-1);

        rep(z, k) {
            int maxv = 0, maxi, acc = 0, l, r;
            rep(i, n) {
                acc += R[i][PR[i]];
                acc -= L[i][PL[i]];
                if(acc>maxv) {
                    maxi = i;
                    maxv = acc;
                }
            }
            l = *tlow.find_by_order(tlow.order_of_key(maxi-1));
            r = *thigh.find_by_order(thigh.order_of_key(maxi+1));
            fwd(i,maxi+1,r+1) PL[i] = maxi+1;
            ford(i,maxi,l) PR[i] = maxi;
        }
        int ans = 0;
        rep(i,n) ans += L[i][PL[i]];
        cout << ans << '\n';
    }

    return 0;
}