112560

#include <iostream>
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")

#define mp make_pair
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ld, ld> pld;
typedef pair<ll, ll> pl;
typedef vector<int> veci;
typedef vector<bool> vecb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;

const int INF_I = 1e9;
const ll INF_LL = 1e18;
const int MOD = 1000000007;
const double eps = 1e-6;

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, k;
    cin >> n >> k;
    veci a(n), cnt(n+1);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    int t = 0;
    int L = 0, R = INF_I;
    if (cnt[a[0]]++ == 0)
        t++;
    for (int l = 0, r = 0; r < n && l < n; ){
        if (t == k) {
            if (r - l < R - L && r - l + 1 > 0)
                L = l, R = r;
            if (cnt[a[l]] == 1)
                t--;
            --cnt[a[l]];
            l++;
        } else {
            r++;
            if (cnt[a[r]]++ == 0)
                t++;
        }
    }
    cout << L + 1 << " " << R + 1 << endl;

    return 0;
}