#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define ull unsigned long long
#define vecint vector<int>
#define vecchar vector<char>
#define un_set unordered_set
#define un_map unordered_map
#define max_ele(v) *max_element(v.begin(), v.end())
#define min_ele(v) *min_element(v.begin(), v.end())
#define sort_asc(v) sort(v.begin(), v.end())
#define sort_dec(v) sort((v).begin(), (v).end(), greater<>())
#define Reverse(v) reverse(v.begin(), v.end())
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define coutall(v)     \
    for (auto &it : v) \
    cout << it << " "
#define coutnewline(v) \
    for (auto &it : v) \
    cout << it << '\n'
#define cinall(v)      \
    for (auto &it : v) \
    cin >> it
#define yes cout << "YES\n"
#define no cout << "NO\n"

constexpr char nl = '\n';

void solucionar()
{
    int n, k;
    cin >> n >> k;
    vecint arr(n), temp(n), error;
    cinall(arr);
    for (int i = 0; i < n; i++)
    {
        temp[i] = i + 1;
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (temp[i] == arr[j])
            {
                if (temp[i] != j + 1)
                {
                    error.pb(j+1);
                }
            }
            else
            {
                continue;
            }
        }
    }
    sort_asc(error);
    // for(int i=0;i<error.size()-1;i++){
    //     if(error[i+1]-error[i]!=1){
    //         no;
    //         return;
    //     }
    // }
    // cout<<error.size()<<endl;
    int last=error.size()-1;
    if(((error[last]-error[0])+1)>k){
        no;
        return;
    }
    else{
        yes;
        cout<<error[0]<<" "<<error[error.size()-1]<<endl;
    }
}

int main()
{
    // ios_base::sync_with_stdio(false);
    // cin.tie(0);

    // int tests;
    // cin >> tests;
    // while (tests-- > 0)
    // {
    // }
        solucionar();
    
    return 0;
}