#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4");
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld double


using namespace std;

const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    a[0] = 0;
    vector<int> p(n + 1);
    p[0] = 0;
    for (int i = 1; i <= n; i++) {
        p[i] = p[i - 1] + a[i];
    }
//    for (auto k : p) cout << k << " ";
//    cout << "\n";
    int ind1 = 0, ind2 = 1, d = INF, ans1, ans2;
    while (ind2 <= n) {
        while (ind2 <= n && p[ind2] - p[ind1] < k) ind2++;
//        cout << ind1 << " " << ind2 << "\n";
        while (p[ind2] - p[ind1] > k) ind1++;
        while (p[ind2] - p[ind1] == k) ind1++;
        ind1--;
//        cout << ind1 << " " << ind2 << "\n";
        if (p[ind2] - p[ind1] == k) {
            if (ind2 - ind1 < d) {
                d = ind2 - ind1;
                ans1 = ind1 + 1;
                ans2 = ind2;
            }
        }
        ind2++;
    }
    if (d == INF) cout << -1;
    else cout << ans1 << " " << ans2;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q = 1;
//    cin >> q;
    while (q--) solve();
}
/*

*/