#include <bits/stdc++.h>
#define int long long
#define sqrtl(x) sqrt(x)
using namespace std;

namespace solve {
  namespace test_case {
    void main() {
      int n, k; cin >> n >> k;
      vector<int> a(n);
      for (auto &x: a) cin >> x;
      int i (0), j(n - 1); 
      if (is_sorted(a.begin(), a.end())) {
        cout << "YES\n" << 0 << ' ' << n << '\n';
      } else {
        auto b = vector(a);
        sort(b.begin(), b.end());
        int i (0), j (n - 1);
        for (; i < n; i++) {
          if (b[i] != a[i]) break;
        }
        for (; j >= 0; j--) {
          if (b[j] != a[j]) break;
        }
        if (j - i + 1 <= k) cout << "YES\n" << i + 1 << ' ' << j + 1 << '\n';
        else cout << "NO\n";
      }
    }
  }

  void main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t (1); // cin >> t; 
    while (t--) {
      test_case::main();
    }
  }
}

signed main() { solve::main(); }