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)
 

eCA9IFsxLDAsMSwyLDEwLDVdCmsgPSAzCgpwcmVmaXggPSBbMF0gKiBsZW4oeCkKcHJlZml4WzBdID0geFswXQpmb3IgaSBpbiByYW5nZSgxLCBsZW4oeCkpOgogICAgcHJlZml4W2ldID0gcHJlZml4W2ktMV0reFtpXQoKbWF4bGVuID0gMAojIEluaXRpYWxpemUgbWlubGVuIHRvIGluZmluaXR5IHNvIGFueSBmb3VuZCBsZW5ndGggaXMgc21hbGxlciB0aGFuIGl0Cm1pbmxlbiA9IGZsb2F0KCdpbmYnKQpmb3VuZCA9IEZhbHNlCgpmb3IgaSBpbiByYW5nZSgxLCBsZW4oeCkpOgogICAgZm9yIGogaW4gcmFuZ2UoMCwgaSk6CiAgICAgICAgaWYgcHJlZml4W2ldID09IHByZWZpeFtqXSArIGs6CiAgICAgICAgICAgIGxlbmd0aCA9IGkgLSBqCiAgICAgICAgICAgIG1heGxlbiA9IG1heChsZW5ndGgsIG1heGxlbikKICAgICAgICAgICAgbWlubGVuID0gbWluKGxlbmd0aCwgbWlubGVuKQogICAgICAgICAgICBmb3VuZCA9IFRydWUKCiMgUmVzZXQgbWlubGVuIHRvIDAgaWYgbm8gbWF0Y2hpbmcgc3ViYXJyYXkgd2FzIGZvdW5kCmlmIG5vdCBmb3VuZDoKICAgIG1pbmxlbiA9IDAKCnByaW50KG1heGxlbiwgbWlubGVuKQo=