# your code goes here
x = [15, -2, 2, -8, 1, 7, 10]
k = 0
 
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)
            found = True
 
# Reset minlen to 0 if no matching subarray was found
if not found:
    minlen = 0
 
print(maxlen, minlen)
 

IyB5b3VyIGNvZGUgZ29lcyBoZXJlCnggPSBbMTUsIC0yLCAyLCAtOCwgMSwgNywgMTBdCmsgPSAwCgpwcmVmaXggPSBbMF0gKiBsZW4oeCkKcHJlZml4WzBdID0geFswXQpmb3IgaSBpbiByYW5nZSgxLCBsZW4oeCkpOgogICAgcHJlZml4W2ldID0gcHJlZml4W2ktMV0reFtpXQoKbWF4bGVuID0gMAojIEluaXRpYWxpemUgbWlubGVuIHRvIGluZmluaXR5IHNvIGFueSBmb3VuZCBsZW5ndGggaXMgc21hbGxlciB0aGFuIGl0Cm1pbmxlbiA9IGZsb2F0KCdpbmYnKQpmb3VuZCA9IEZhbHNlCgpmb3IgaSBpbiByYW5nZSgxLCBsZW4oeCkpOgogICAgZm9yIGogaW4gcmFuZ2UoMCwgaSk6CiAgICAgICAgaWYgcHJlZml4W2ldID09IHByZWZpeFtqXSArIGs6CiAgICAgICAgICAgIGxlbmd0aCA9IGkgLSBqCiAgICAgICAgICAgIG1heGxlbiA9IG1heChsZW5ndGgsIG1heGxlbikKICAgICAgICAgICAgZm91bmQgPSBUcnVlCgojIFJlc2V0IG1pbmxlbiB0byAwIGlmIG5vIG1hdGNoaW5nIHN1YmFycmF5IHdhcyBmb3VuZAppZiBub3QgZm91bmQ6CiAgICBtaW5sZW4gPSAwCgpwcmludChtYXhsZW4sIG1pbmxlbikK