#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long n,q,d[100001][21],x,y,p;
int main()
{
    fin>>n>>q;
    for(int i=1;i<=n;i++)fin>>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<=q;i++)
    {
        fin>>x>>y;
        if(x>y)swap(x,y);
        p=log2(y-x+1);
        fout<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
    }
    return 0;
}