#include<cmath>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
unsigned int lg[100001],n,m,a[20][100001];
int main()
{
    int i,j,x,y;
    f>>n>>m;
    lg[1] = 0;
    for(i = 2; i <= n; i ++)
        lg[i] = lg[i/2] + 1;
    for(i = 1; i <= n; i ++)
        f>>a[0][i];
    for(i = 1; i <= lg[n]; i ++)
        for(j = 1; j <=n - (1<<(i-1)); j ++)
            a[i][j] = min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
    for(i = 1; i <= m; i ++)
    {
        f>>x>>y;
        int k;
        k = lg[y-x+1];
        g<<min(a[k][x],a[k][y-(1<<k)+1])<<'\n';
    }
}