#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 100005;
int n, q, a[MAXN];
int segTree[4 * MAXN], lazy[4 * MAXN];
int cnt[MAXN]; 


int getID(int x) {
    return lower_bound(cnt, cnt + n, x) - cnt;
}

void update(int node, int start, int end, int l, int r, int val) {
    if (lazy[node] != -1) {
        segTree[node] = (end - start + 1) * lazy[node];
        if (start != end) {
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        lazy[node] = -1;
    }
    if (start > end || start > r || end < l) return;
    if (start >= l && end <= r) {
        segTree[node] = (end - start + 1) * val;
        if (start != end) {
            lazy[node * 2] = val;
            lazy[node * 2 + 1] = val;
        }
        return;
    }
    int mid = (start + end) / 2;
    update(node * 2, start, mid, l, r, val);
    update(node * 2 + 1, mid + 1, end, l, r, val);
    segTree[node] = segTree[node * 2] + segTree[node * 2 + 1];
}


int query(int node, int start, int end, int l, int r) {
    if (lazy[node] != -1) {
        segTree[node] = (end - start + 1) * lazy[node];
        if (start != end) {
            lazy[node * 2] = lazy[node];
            lazy[node * 2 + 1] = lazy[node];
        }
        lazy[node] = -1;
    }
    if (start > end || start > r || end < l) return 0;
    if (start >= l && end <= r) return segTree[node];
    int mid = (start + end) / 2;
    int p1 = query(node * 2, start, mid, l, r);
    int p2 = query(node * 2 + 1, mid + 1, end, l, r);
    return p1 + p2;
}

int main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cnt[a[i]]++;
    }
    for (int i = 1; i <= n; i++) {
        cnt[i] += cnt[i - 1];
    }
    int last = 0;
    for (int i = 1; i <= n; i++) {
        cnt[i] += last;
        last = cnt[i];
    }
    for (int i = 1; i <= n; i++) {
        a[i] = getID(a[i]);
    }
    for (int i = 1; i <= 4 * n; i++) {
        segTree[i] = 0;
        lazy[i] = -1;
    }
    for (int i = 1; i <= n; i++) {
        update(1, 1, n, i, i, 1);
    }
    while (q--) {
        int l, r;
        cin >> l >> r;
        int x = query(1, 1, n, l, r) + 1;
        int y = r;
        while (y - x + 1 > r - l + 1) {
            if (query(1, 1, n, l, y) == r - l + 1) break;
            y--;
        }
        cout << y - x + 1 << endl;
    }
    return 0;
}