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

const int MAXN = 600005;
typedef long long ll;
typedef pair<int, int> PR;
#define fi first
#define se second
#define PB push_back
#define MP make_pair

ll ans = 0;
int mx[MAXN], a[MAXN], dis[MAXN], Dis[MAXN], cnt[MAXN], n, K;

void solve(int l, int r) {
	if (l == r) return;
	int mid = (l + r) >> 1;
	for (int i = mid; i >= l ; -- i) mx[i] = (i == mid ? a[i] : max(mx[i + 1], a[i]));
	for (int i = mid + 1; i <= r ; ++ i) mx[i] = (i == mid + 1 ? a[i] : max(mx[i - 1], a[i]));

	for (int i = mid + 1, nw = mid; i <= r ; ++ i) {
		while (nw >= l && mx[nw] < mx[i]) -- nw;
		ans += max(min(K - mx[r] + i + 1, mid) - max(nw + 1, dis[i]) + 1, 0);
	}
	for (int i = mid, nw = mid + 1; i >= l ; -- i) {
		while (nw <= r && mx[nw] <= mx[i]) ++ nw;
		ans += max(min(nw - 1, Dis[i]) - max(mx[l] + i - 1 - K, mid + 1) + 1, 0);
	}
	solve(l, mid);
	solve(mid + 1, r);
}
signed main() {
#ifndef ONLINE_JUDGE
	freopen("a.in", "r", stdin);
#endif
	int Case;
	scanf("%d", &Case);
	while (Case --) {
		scanf("%d%d", &n, &K);
		for (int i = 1; i <= n ; ++ i) scanf("%d", &a[i]);

		for (int i = 1; i <= n ; ++ i) cnt[i] = 0;
		for (int i = 1, l = 1, num = 0; i <= n ; ++ i) {
			++ cnt[a[i]];
			if (cnt[a[i]] == 2) ++ num;
			while (num) {
				if (cnt[a[l]] == 2) -- num;
				-- cnt[a[l]], ++ l;
			}
			dis[i] = l;
		}
		
		for (int i = 1; i <= n ; ++ i) cnt[i] = 0;
		for (int i = n, r = n, num = 0; i >= 1 ; -- i) {
			++ cnt[a[i]];
			if (cnt[a[i]] == 2) ++ num;
			while (num) {
				if (cnt[a[r]] == 2) -- num;
				-- cnt[a[r]], -- r;
			}
			Dis[i] = r;
		}

		ans = 0;
		for (int i = 1; i <= n ; ++ i)
			if (a[i] - 1 <= K) ++ ans;
		solve(1, n);
		printf("%lld\n", ans);
	}
	return 0;
}