//on the name of Allah:)
#include<bits/stdc++.h>
#define int long long
#define Endl "\n"
#define pi 2 * acos(0.0)
#define mod 1000000007
#define Mul(a,b) (a%mod * b%mod)%mod
#define Add(a,b) (a%mod + b%mod)%mod
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define gcd(x, y) (__gcd(x, y))
#define lcm(x, y) ((x/gcd(x, y))*y)
#define faster cin.tie(NULL), cout.tie(NULL);
#define TC int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
int n,k;
cin>>n>>k;
vector<int>v(n),v1;
deque<int>dq;
if(k>n)
{
cout<<"NO"<<endl;
return;
}
for(int i=0; i<n; i++)
{
cin>>v[i];
}
v1=v;
if(is_sorted(all(v)))
{
cout<<"YES"<<endl;
cout<<1<<" "<<k<<" ";
return;
}
for(int i=0; i<k; i++)
{
dq.push_back(v[i]);
}
int it=0,it1=k-1;
if(!is_sorted(all(dq)))
{
sort(v.begin() + it, v.begin() + it1+ 1);
if(is_sorted(all(v)))
{
cout<<"YES"<<endl;
cout<<1<<" "<<k<<" ";
return;
}
}
v=v1;
for(int i=k; i<n; i++)
{
dq.pop_front();
dq.push_back(v[i]);
it++;
it1++;
v=v1;
if(!is_sorted(all(dq)))
{
sort(v.begin() + it, v.begin() + it1+ 1);
if(is_sorted(all(v)))
{
cout<<"YES"<<endl;
cout<<it+1<<" "<<it1+1<<" ";
return;
}
}
}
cout<<"NO"<<endl;
}
int32_t main()
{
ios::sync_with_stdio(false);
//faster
//TC
{
//cout<<"Case "<<i<<": ";
s();
}
}