#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k; cin>>n>>k;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
 
unordered_map<int,int> mp1,mp2;
mp1[0]=-1;
mp2[0]=-1;
 
int x=0,lmin=INT_MAX,lmax=0;
 
for(int j=0;j<n;j++){
x+=a[j];
 
if(mp1.find(x-k)!=mp1.end()){
int i=mp1[x-k]+1;
lmin=min(lmin,j-i+1);
}
mp1[x]=j;
 
if(mp2.find(x-k)!=mp2.end()){
int i=mp2[x-k]+1;
lmax=max(lmax,j-i+1);
}
 
if(mp2.find(x)==mp2.end())
mp2[x]=j;
}
 
if(lmax==0)
cout<<-1<<" "<<-1;
else
cout<<lmax<<" "<<lmin;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCl7CmludCBuLGs7IGNpbj4+bj4+azsKaW50IGFbbl07CmZvcihpbnQgaT0wO2k8bjtpKyspIGNpbj4+YVtpXTsKCnVub3JkZXJlZF9tYXA8aW50LGludD4gbXAxLG1wMjsKbXAxWzBdPS0xOwptcDJbMF09LTE7CgppbnQgeD0wLGxtaW49SU5UX01BWCxsbWF4PTA7Cgpmb3IoaW50IGo9MDtqPG47aisrKXsKeCs9YVtqXTsKCmlmKG1wMS5maW5kKHgtaykhPW1wMS5lbmQoKSl7CmludCBpPW1wMVt4LWtdKzE7CmxtaW49bWluKGxtaW4sai1pKzEpOwp9Cm1wMVt4XT1qOwoKaWYobXAyLmZpbmQoeC1rKSE9bXAyLmVuZCgpKXsKaW50IGk9bXAyW3gta10rMTsKbG1heD1tYXgobG1heCxqLWkrMSk7Cn0KCmlmKG1wMi5maW5kKHgpPT1tcDIuZW5kKCkpCm1wMlt4XT1qOwp9CgppZihsbWF4PT0wKQpjb3V0PDwtMTw8IiAiPDwtMTsKZWxzZQpjb3V0PDxsbWF4PDwiICI8PGxtaW47Cn0=

NSA1CjEgMiAzIDIgNQ==

5 5
1 2 3 2 5