#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int T, n, k, a[N], Max;
deque<int>q;
struct sb {
	int x, y, sum;
} p[N];
bool cmp(sb x, sb y) {
	return x.sum > y.sum;
}
int dsb(int m) {
	int cnt1 = 0, cnt2 = 0;
	if (!q.empty())q.pop_back();
	for (int i = 1; i <= n; i++) {
		while (!q.empty() && i - m >= q.front())q.pop_front();
		while (!q.empty() && a[i] <= a[q.back()])q.pop_back();
		q.push_back(i);
		if (i >= m)p[++cnt1].x = a[q.front()];
	}
	while (!q.empty())q.pop_back();
	for (int i = 1; i <= n; i++) {
		while (!q.empty() && i - m >= q.front())q.pop_front();
		while (!q.empty() && a[i] >= a[q.back()])q.pop_back();
		q.push_back(i);
		if (i >= m)p[++cnt2].y = a[q.front()];
	}
	for (int i = 1; i <= cnt1; i++)p[i].sum = p[i].y - p[i].x;
	sort(p + 1, p + 1 + cnt1, cmp);
	return p[k].sum;
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--) {
		cin >> n >> k;
		for (int i = 1; i <= n; i++)cin >> a[i];
		int l = 1, r = n - k + 1, mid, ans, Max;
		Max = dsb(n - k + 1);
		while (l <= r) {
			mid = (l + r) >> 1;
			ans = dsb(mid);
			if (ans == Max)r = mid - 1;
			else l = mid + 1;
		}
		cout << Max << ' ' << l << '\n';
	}
	return 0;
}