#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,d[100005][20];
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
        in>>d[i][0];
    for(int j=1;(1<<j)<=n;j++)
        for(int i=1;(i+(1<<(j))-1)<=n;i++)
    d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);

    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y;
        int p=log2(y-x+1);
        out<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
    }
    return 0;
}