#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

int N, M, rmq[20][100005], lg[100005], x, y, l;

int main()
{
    f>>N>>M>>rmq[0][1];
    for (int i=2; i<=N; ++i)
        f>>rmq[0][i], lg[i]=lg[i/2]+1;

    for (int i=1; (1<<i)<=N; ++i)
        for (int j=1; j<=N-(1<<i)+1; ++j)
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);

    while (M--)
    {
        f>>x>>y; l=lg[y-x+1];
        g<<min(rmq[l][x], rmq[l][y-(1<<l)+1])<<'\n';
    }
    return 0;
}