#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int d[100001][40],n,m,j,i,a,b;
int main()
{
    int i,j;
    in>>n>>m;
    for(int i=1;i<=n;i++)
    {
        in>>d[i][0];
    }
    for(j=1;(1<<j)<=n;j++)
    {
        for(i=1;i+(1<<j)-1<=n;i++)
        {
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
        }
    }
    for(i=1;i<=m;i++)
    {
        in>>a>>b;
        int x=log2(b-a+1);
        out<<min(d[a][x],d[b-(1<<x)+1][x])<<'\n';
    }
    return 0;
}