#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int nmax=100005;
int v[nmax];
int arbore[4*nmax];
int n,m,x,y;
void build (int nod, int st, int dr)
{
    if(st==dr) arbore[nod]=v[st];
    else if(st<dr)
    {
        int m=(st+dr)/2;
        int nod1=2*nod;
        int nod2=2*nod+1;
        build(nod1,st,m);
        build(nod2,m+1,dr);
        arbore[nod]=min(arbore[nod1],arbore[nod2]);
    }
}
int solve (int nod, int a, int b, int st, int dr)
{
    if(a==st && b==dr) return arbore[nod];
    else if(st<dr)
    {
        int m=(st+dr)/2;
        int nod1=2*nod;
        int nod2=2*nod+1;
        if(a<=m)
        {
            if(b<=m) return solve(nod1,a,b,st,m);
            else return min(solve(nod1,a,m,st,m),solve(nod2,m+1,b,m+1,dr));
        }
        else return solve(nod2,a,b,m+1,dr);
    }
}
int main()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
        in>>v[i];
    build(1,1,n);
    for(;m;m--)
    {
        in>>x>>y;
        out<<solve(1,x,y,1,n)<<'\n';
    }
    return 0;
}