#include <iostream>
#include <fstream>

using namespace std;

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

long long a[20][100010], n, m, b[100001], v[100001], i, j , k, x, y, d, s;

int main()
{
    f>>n>>m;

    for(i=1;i<=n;i++)
        f>>v[i];
    b[1] = 0;

    for(i=2;i<=n;i++)
        b[i] = b[i/2] + 1;

    for(i=1;i<=n;i++)
        a[0][i] = v[i];

    for(i=1; (1<<i) <=n;i++)
    {
        for(j=1; j <= n-(1<<i)+1;j++)
        {
            k = 1<<(i-1);
            a[i][j] = min(a[i-1][j],a[i-1][j+k]);

        }
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        d = y-x+1;
        k = b[d];
        s = d - (1<<k);
        g<<min(a[k][x], a[k][x+s])<<endl;
    }
    return 0;
}