#include <bits/stdc++.h>
using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

int rmq[17][100001];///rmq[j][i] = minimul pentru intervalul [i - (1 << j) + 1, i];
int logue[100001];

int minim(int a, int b)
{
    int l = logue[b - a + 1];
    return min(rmq[l][b], rmq[l][a + (1 << l) - 1]);
}

int main()
{
    int n, m, a, b;
    in >> n >> m;
    for(int i = 1; i <= n; i++)
        in >> rmq[0][i];
    for(int i = 2; i <= n; i++)
        logue[i] = 1 + logue[i / 2];
    for(int j = 1; (1 << j) <= n; j++)
        for(int i = (1 << j); i <= n; i++)
            rmq[j][i] = min(rmq[j - 1][i], rmq[j - 1][i - (1 << (j - 1))]);
    for(int i = 1; i <= m; i++)
    {
        in >> a >> b;
        out << minim(a, b) << '\n';
    }
    return 0;
}