#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define N (ll)1e6
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1,i=1,j,p,mx,tot,n,a,m,x,y,k,rt,c,b=1;
    //cin>>t;
    while(t--){
        cin>>n>>k;
        ll ar[n],br[n];
        for(a=0;a<n;a++){
            cin>>ar[a];
            br[a]=ar[a];
        }
        sort(ar,ar+n);
        for(a=0;a<n;a++){
            if(ar[a]!=br[a]){
                i=a;
                break;
            }
        }
        for(a=n-1;a>=0;a--){
            if(ar[a]!=br[a]){
                j=a;
                break;
            }
        }
        if(j-i+1<=k){
            cout<<"YES\n";
            cout<<i+1<<' '<<j+1<<endl;
        }
        else
            cout<<"NO\n";
    }
}