#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    

    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        l--; r--; 
        

        set<int> elements;
        for (int j = l; j <= r; j++) {
            elements.insert(a[j]);
        }
        

        auto minMax = minmax_element(elements.begin(), elements.end());
        int min_val = *minMax.first;   
        int max_val = *minMax.second;   
        int result = max_val - min_val + 1;
        cout << result << endl; 
    }

    return 0;
}