#include <bits/stdc++.h>

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

int n, m, rmq[21][100001], v[100001], pw=1, lg;

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
        rmq[0][i]=v[i];
    }
    while(pw<=n)
        {pw*=2; lg++;}
    pw/=2;
    lg--;
    for(int i=1; i<=lg; i++)
    {
        for(int j=1; j<=n+1-(1<<i); j++)
        rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
    }
    for(int i=1; i<=m; i++)
    {
        int a, b, x=1, y=0;
        fin>>a>>b;
        while(x<=b-a+1)
        {
            x*=2;
            y++;
        }
        x/=2;
        y--;
        fout<<min(rmq[y][a], rmq[y][b-x+1])<<'\n';
    }
    return 0;
}