#include <bits/stdc++.h>

using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n,m,i,x,y;
int a[100005];
int rmq[100005][40];
void build()
{
    for(int b=0;(1<<b)<=n;b++)
    {
        for(int i=1;i+(1<<b)-1<=n;i++)
        {
            if(b==0)
                rmq[i][b]=a[i];
            else
                rmq[i][b]=min(rmq[i][b-1], rmq[i+(1<<b)/2][b-1]);
        }
    }
}
int query(int l, int r)
{
    int b=0;
    while(2*(1<<b)<r-l+1)
        b++;

    return min(rmq[l][b], rmq[r-(1<<b)+1][b]);
}
int main()
{
    fin>>n;
    fin>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];

    build();

    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        fout<<query(x, y)<<'\n';
    }
    return 0;
}