#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************

vector<int> a;

pair<int,int> consistency(int n, int k){

	int s = 0, e = 0;
	int maxPeaks = INT32_MIN;
	int left = -1;
	
	set<int> peaks;
		
	while(e<n){
		if(e-2>=0 &&  a[e-1] > a[e-2] && a[e-1] > a[e]){
			peaks.insert(e-1);	
		}
		
		if(e-s+1<k){
			e++;
		}
		else{
			int p = peaks.size();
			if(p > maxPeaks){
				maxPeaks = p;
				left = s;
			}
			
			if(peaks.count(s+1)) peaks.erase(s+1);
			s++;
			e++;
		}
	}
	
	
	return {maxPeaks+1, left+1};

}











void solve() {
    
    int n, k;
    cin>>n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n, k);
    cout << ans.first << " " << ans.second << endl;


}





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

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}