#include <iostream>
#include <fstream>
#define nmax 100005
using namespace std;

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

    // 2^20 > nmax
int RMQ[20][nmax];
int pow[nmax], n, m;

void generare()
{
    int k=0;
    for(int i=1; i<=nmax; i++)
    {
        if((1<<k) == i) pow[i] == k++;
                   else pow[i] == pow[i-1];
    }

    for(int j=1; j<=n; j++)
    {
        f >> RMQ[0][j];
    }
    for(int i=1; (1<<i)<=n; i++)
    {
        for(int j=1; j+(1<<j)-1<=n; j++)
        {
            RMQ[i][j] = min(RMQ[i-1][j], RMQ[i-1][j+(1<<(i-1))]);
        }
    }
    return;
}

int solve(int x, int y)
{
    int p = pow[y-x+1]; // lungime
    return min(RMQ[p][x], RMQ[p][y-(1<<p)+1]);
}
int main()
{
    f >> n >> m;
    generare();
    int x, y;
    for (int i=1; i<=m; i++)
    {
        f >> x >> y;
        g << solve(x, y) << "\n";
    }

    f.close();
    g.close();
    return 0;
}