/* 
 *   @author:- MAHMUDUL HASAN SAKIB
 *   DATE & TIME :- 2024-11-05 20:29:13
 *   BANGLADESH , SYLHET.
 */ 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define PI acos(-1.0)
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define maxn 500005
#define mod 1000000007
#define inf 1000000007
#define pii pair<ll,ll>
#define vii vector<pii>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define lcm(a,b) ((a*b)/__gcd(a,b));
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define setbits(x) __builtin_popcountll(x)
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rev_str(str) reverse(str.begin(),str.end());
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define sum(a) (accumulate((a).begin(), (a).end(), 0LL))
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
bool sortByValue(const pair<int, int>& a, const pair<int, int>& b) {return a.second > b.second;}
const int N= 1e5+10;
void solve(){
    ll n,k;cin>>n>>k;
    vi p(n),q;
    vii ji;
    map<ll,ll>mp;
    rep(i,0,n) {
        cin>>p[i];
        mp[p[i]]=i;
    }
    ll last,first;
    q=p;
    srt(q);
    bool ok = false;
    ll cnt =0;
    rep(i,0,n){
        if(p[i]!=q[i] && ok == false){
            first = i+1;
            ok = true;
            ll na = mp[q[i]];
            ji.emplace_back(i+1,na+1);
            swap(p[i],p[na]);
            cnt++;
            if(cnt>k-1){
                cout<<"NO"<<endl;
                return;
            }
        }
        else if(p[i]!=q[i] && ok == true){
            ll na = mp[q[i]];
            ji.emplace_back(i+1,na+1);
            swap(p[i],p[na]);
            cnt++;
            if(cnt>k-1){
                cout<<"NO"<<endl;
                return;
            } 
        }
        else if(ok && p[i]==q[i]){
            if(is_sorted(all(p))){
                last = i+1;
                break;
            }
            cnt++;
            if(cnt>k-1){
                cout<<"NO"<<endl;
                return;
            }
        }
    }
    cout<<"YES"<<endl;
    cout<<first<<" "<<last<<endl;
    //printp(ji);
}

int main() {
    fast
    ll t = 1;//cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}