#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5, LOGMAX = 17;
int a[NMAX + 5], rmq[LOGMAX + 5][NMAX + 5];

int main()
{
    #ifndef TEST 
        freopen("rmq.in", "r", stdin);
        freopen("rmq.out", "w", stdout);
    #endif
    ios_base :: sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        rmq[0][i] = a[i];
    }
    for (int j = 1; (1 << j) <= n; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            rmq[j][i] = min(rmq[j - 1][i], rmq[j - 1][i + (1 << (j - 1))]);
    while (m--)
    {
        int left, right;
        cin >> left >> right;
        int lg = __lg(right - left + 1);
        cout << min(rmq[lg][left], rmq[lg][right - (1 << lg) + 1]) << '\n';
    }
    return 0;
}