import java.util.Scanner;
import java.util.TreeMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;

public class Main {
    
    static Scanner in = new Scanner(System.in);
    
    static int n, h, w, testCases, k;
    
    static char x[];
    
    static long a[];
    
    static void solve() {
        
        List<Long> list = new ArrayList<>();
        
        for(int i = 0; i < n; ++i) {
            
            list.add(a[i]);
            
        } 
        
        Collections.sort(list);
        
        List<Integer> index = new ArrayList<>();
        
        int needReplace = 0, len = 0;
        
        for(int i = 0, j = 0; i < n; ++i) {
            
            if(list.get(i) != a[i]) {
                
                //++needReplace;
                index.add(i + 1);
                needReplace = (i + 1) - index.get(0) + 1;
                j = 1;
                
            }
            
        }
        
        if(needReplace > k) {
            
            System.out.println("NO");
            
        } else {
            
            System.out.println("YES");
            System.out.println(index.get(0) + " " + index.get(index.size() - 1));
            
        }
        
    }
    
  public static void main(String args[]) {
   
      testCases = 1;
      
      for(int t = 0; t < testCases; ++t) {
          
          input();
          solve();
          
      }
   
  }
  
  private static void input() {
      
      n = in.nextInt();
      k = in.nextInt();
      
      a = new long[n];
      
      for(int i = 0; i < n; ++i) {
          
          a[i] = in.nextLong();
          
      }

  }
  
}