------
## 最终结论
```python
def find_max_peaks(test_cases):
    results = []
    for n, k, heights in test_cases:
        peaks = [0] * n
        
        # Calculate peaks
        for i in range(1, n - 1):
            if heights[i - 1] < heights[i] > heights[i + 1]:
                peaks[i] = 1

        # Calculate number of peaks in the first window
        current_peaks = sum(peaks[1:k-1])
        max_peaks = current_peaks
        best_l = 0

        # Slide the window and calculate peaks
        for l in range(1, n - k + 1):
            current_peaks += peaks[l + k - 2] - peaks[l]
            if current_peaks > max_peaks:
                max_peaks = current_peaks
                best_l = l

        results.append((max_peaks + 1, best_l + 1))
    
    return results

# Read input
import sys
input = sys.stdin.read
data = input().split()

index = 0
t = int(data[index])
index += 1

test_cases = []
for _ in range(t):
    n, k = int(data[index]), int(data[index+1])
    index += 2
    heights = list(map(int, data[index:index+n]))
    index += n
    test_cases.append((n, k, heights))

# Get results and print them
results = find_max_peaks(test_cases)
for res in results:
    print(res[0], res[1])
```