#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,i,x,y,p,j,d[100005][25],a[1000005],m;
int main()
{
    fin>>n>>m;

    for(i=1;i<=n;i++)
    {
        fin>>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++)
    {
        fin>>x>>y;
        p=log2(y-x+1);
        int rez=min(d[x][p],d[y-(1<<p)+1][p]);
        fout<<rez<<'\n';
    }

    return 0;
}