#include <iostream>
#include <fstream>

using namespace std;
#define MaxN 100000
#define LOG 17
int v[MaxN], a[MaxN][LOG], log[MaxN+1];
int n;
int f(int x, int y)
{
    if(x<y) return x;
    return y;
}

void build()
{
    int i, p;
    for(i=0; i<n; i++)
    {
        a[i][0]=v[i];
    }

    for(p=1; p<LOG; p++)
    {
        for(i=0; i+(1<<p)-1<n; i++)
        {
            a[i][p]=f(a[i][p-1], a[i+(1<<(p-1))][p-1]);
        }
    }

}

int query(int st, int dr)
{
    int lung;
    lung=dr-st+1;
    return f(a[st][log[lung]], a[dr-(1<<log[lung])+1][log[lung]]);
}
int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int m, a, b, i;
    in>>n>>m;
    for(i=0; i<n; i++) in>>v[i];

    log[1]=0;
    for(i=2; i<=MaxN; i++)
    {
        log[i]=log[i/2]+1;
    }
    build();
    for(i=0; i<m; i++)
    {
        in>>a>>b;
        a--; b--;
        out<<query(a, b)<<'\n';
    }
    return 0;
}