// #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;

    for(int i=1; i<=n; i++) cin >> a[i];

    suf[n+1] = 1;
    a[n+1] = inf;
    for(int i=n; i>=1; i--) 
        suf[i] = (suf[i+1] && a[i] <= a[i+1]);
    
    pre[0] = 1;
    for(int i=1; i<=n; i++) 
        pre[i] = (pre[i-1] && a[i] >= a[i-1]);

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

    int f = (*st.rbegin() <= a[k+1] and suf[k+1]);
    if(f) {
        cout << "YES" << endl;
        cout << "1 " << k << endl;
        return;
    }

    for(int i=k+1; i<=n; i++) {
        st.insert(a[i]);
        st.erase(st.find(a[i-k]));

        f |= (*st.rbegin() <= a[i+1] and suf[i+1] && pre[i-k] && a[i-k] <= a[i-k+1]);
        
        if(f) {
            cout << "YES" << endl;
            cout << i-k+1 << " " << i << 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;
}