#include <bits/stdc++.h>
#define dim 100005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a[dim],rmq[dim][20],p2[dim];
void Read()
{
    f>>n>>m;
    for(int i=1; i<=n; ++i)
        f>>a[i];
}
void Solve()
{
    for(int i=1;i<=n;++i)
        rmq[i][0]=a[i];
    for(int j=1;(1<<j)<=n;++j)
        for(int i=1;i<=n;++i)
        rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
}
int Answer(int x,int y)
{
    if(x>y)
        swap(x,y);
    int k=0;
    while((1<<k)<=y-x+1)
        ++k;
    --k;
    return min(rmq[x][k],rmq[y-(1<<k)+1][k]);
}
void Query()
{
    for(int i=1; i<=m; ++i)
    {
        int x,y;
        f>>x>>y;
        g<<Answer(x,y)<<"\n";
    }
}
int main()
{
    Read();
    Solve();
    Query();
    return 0;
}