#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, k;
    cin >> n >> k;
    vector<ll> v(n);
    set<ll> st;
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
        st.insert(x);
    }
    // if(st.size() < v.size()) {
    //     no;
    //     return;
    // }
    auto tmp = v;
    sort(all(tmp));

    ll l = -1, r = -2;
    for(int i = 0; i < n; i++) {
        if(v[i] != tmp[i]) {
            l = i;
            break;
        }
    }
    for(int i = n - 1; i >= 0; i--) {
        if(v[i] != tmp[i]) {
            r = i;
            break;
        }
    }

    if(l <= r && r - l + 1 <= k) {
        yes;
        cout << l + 1 << " " << r + 1 << endl;
    }
    else no;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}