#include <bits/stdc++.h>

using namespace std;

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

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

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

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

    for(int r = 1, l = 1; r<=log2(n); r++, l*=2 )
        for(int k = 1; k <= n - 2*l + 1; k++ )
            rmq[r][k] = min(rmq[r-1][k], rmq[r-1][k + 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;
}