#include <bits/stdc++.h>

using namespace std;

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

int n, k, rmq[17][100001];

int main()
{
    fin>>n>>k;

    for(int i=1; i<=n; i++)
        fin>>rmq[0][i];

    for(int r = 1, l = 1; n - 2*l + 1 > 0; r++, l*=2)
        for(int i=1; i<=n - 2*l + 1; i++)
            rmq[r][i] = min(rmq[r-1][i], rmq[r-1][i + l] );

    for(int a, b, i = 1; i<=k; i++)
    {
        fin>>a>>b;
        int r = log2(b - a + 1);
        int l = (1<<r);
        fout<<min( rmq[r][a], rmq[r][b - l + 1] )<<'\n';
    }

    return 0;
}