#include #include #define ll long long using namespace std; void solve(){ int n, q; cin >> n >> q; vector array(n, 0); for (int i = 0 ; i < n; i++) cin >> array[i]; vector dp(n, 0); for (int i = n - 2; i >= 0; i--) if (array[i] <= array[i + 1]) dp[i] = dp[i + 1] + 1; for (int i = 0 ; i < q; i++) { int start, end; cin >> start >> end; if (start + dp[start - 1] >= end)cout << "YES" << endl; else cout << "NO" << endl; } } int main() { solve(); return 0; }