# Arup Guha
# 7/18/2025
# Solution to Sorting K Sums Windows
# 2025 SI@UCF Competitive Programming Camp Contest #2 Problem

nC = int(input())

# Process cases.
for loop in range(nC):

    # Read input.
    toks = input().split()
    n = int(toks[0])
    k = int(toks[1])
    vals = [int(x) for x in input().split()]

    # Get sum of first k.
    s = 0
    for i in range(k):
        s += vals[i]

    # Store items to sort here.
    items = []

    # Store negative sum and index.
    items.append([-s,0])

    # Now figure out new sums for each window with rolling window.
    for i in range(k,n):

        # Subtract left end (out) add right end (int)
        s = s - vals[i-k] + vals[i]

        # Next item.
        items.append([-s, i-k+1])

    # Sorts by max sum, breaking ties by index.
    items.sort()

    # Print space separated.
    for i in range(len(items)-1):
        print(items[i][1]+1, end=" ")
    print(items[-1][1]+1)