#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
using namespace std;

#define mxn 1e5+5
#define fastio ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define endl '\n'
typedef long long ll;

typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> multiordered_set;


int solve(){
    int n, k;
    cin >> n >> k;

    vector<ll> a(n);
    for(ll &ai : a) cin >> ai;
    ll diff = 0;

    for(int i = 1; i < n; i++) {
        a[i] += diff;
        if(a[i] < a[i-1] && k > 0) {
            diff += ll(1e10);
            a[i] += diff;
            k--;
        }
    }

    ll ans = 0;
    multiordered_set ms;
    map<ll, int> occur;
    
    for(int i = 0; i < n; i++) {    
        ans += i - (ms.order_of_key(a[i]) + occur[a[i]]);
        ms.insert(a[i]);
        occur[a[i]]++;
    }

    cout << ans << '\n';

    return 0;
}

int main(){
    fastio;

    int t; 
    cin >> t;

    while(t--){
        solve();
    }

    return 0;
}