// #pragma GCC optimize("O3,unroll-loops,Ofast")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define int long long
#define endl '\n'

using namespace std;
using pii = pair<int, int>;
using tup = tuple<int, int, int>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// template <class T> using ordered_set = tree<T, null_type,
//                          less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int inf = 1e18;
const int mod = 1000000007;
const double eps = 1e-9;
const int N = 500005;

void preprocess() {}

int pre[N], suf[N], a[N];

void solve(int tc) {
    int n, k;
    cin >> n >> k;

    multiset<int> st;
    for(int i=1; i<=n; i++) cin >> a[i], st.insert(a[i]);

    int i = 1, j = n;
    while(i < j and a[i] == *st.begin()) i++, st.erase(st.begin());
    while(j > i and a[j] == *st.rbegin()) j--, st.erase(prev(st.end()));

    if(j-i+1 <= k) {
        cout << "YES" << endl;
        cout << i << ' ' << j << endl;
        return;
    }

    cout << "NO" << endl;
}   

int32_t main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cout.precision(10);

    preprocess();

    int T = 1;
    // cin >> T;

    for (int i = 1; i <= T; i++) {  
        solve(i);
    }

    return 0;
}