---

def main():
    n, w, k, d = map(int, input().split())

    a = []
    while len(a) < n:
        a += map(int, input().split())

    prefix = [0] * (n + 1)
    for i in range(n):
        prefix[i + 1] = prefix[i] + (0 <= a[i] <= d)

    best_start = best_len = 0
    cur_start = cur_len = 0

    for i in range(1, n + 1):
        if prefix[i] - prefix[max(0, i - w)] >= k:
            if cur_len == 0:
                cur_start = i
            cur_len += 1
            if cur_len > best_len:
                best_len = cur_len
                best_start = cur_start
        else:
            cur_len = 0

    print(best_start, best_len)

main()