#include <bits/stdc++.h>

using namespace std;

#define TITLE "rmq"
#define ll long long
#define MOD 1000000000

ifstream f (TITLE".in");
ofstream g (TITLE".out");

int r[20][100003];

void solve()
{
    int n,q;
    f>>n>>q;
    for(int i=1; i<=n; i++)
        f>>r[0][i];
    for(int i=1; (1<<i)<=n ;i++)
    {
        for(int j=1; j<=n; j++)
        {
            r[i][j]=r[i-1][j];
            if(j<=n-(1<<(i-1)))
                r[i][j]=min(r[i][j],r[i-1][j+(1<<(i-1))]);
        }
    }
    int e[100003];
    e[1]=0;
    e[0]=0;
    for(int i=2; i<100003; i++)
        e[i]=e[i/2]+1;
    while(q--)
    {

        int st, dr;
        f>>st>>dr;
        int E=e[dr-st+1];
        g<<min(r[E][st],r[E][dr-(1<<E)+1])<<'\n';
    }
}


int main()
{
    solve();
    return 0;
}