x = [1,0,1,2,10,5]
k = 3

prefix = [0] * len(x)
prefix[0] = x[0]
for i in range(1, len(x)):
    prefix[i] = prefix[i-1]+x[i]

maxlen = 0
# Initialize minlen to infinity so any found length is smaller than it
minlen = float('inf')
found = False

for i in range(1, len(x)):
    for j in range(0, i):
        if prefix[i] == prefix[j] + k:
            length = i - j
            maxlen = max(length, maxlen)
            minlen = min(length, minlen)
            found = True

# Reset minlen to 0 if no matching subarray was found
if not found:
    minlen = 0

print(maxlen, minlen)