#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int MAX = 100000;
int v[MAX+1], mat[MAX+1][17];
int main()
{
    int n, m;
    in>>n>>m;
    for(int i=1; i<=n; ++i)
    {
        in>>v[i];
        mat[i][0]=v[i];
    }
    for(int p=1; (1<<p)<=n; ++p) //pt fiecare putere de 2
    {
        for(int i=1; i+(1<<p)-1<=n; ++i) //nu ies din interval
        {
           /* mat[p][i] = mat[p-1][i];
            int j=i+(1<<(p-1));
            if(j<=n && mat[p][i] > mat[p-1][j])
                mat[p][i] = mat[p-1][j];*/
             mat[i][p] = min(mat[i][p-1], mat[i + (1<<(p-1))][p-1]);
        }
    }
    /*for(int i=0; (1<<i)<n; ++i)
    {
        for(int j=1; j<=n; ++j)
            cout<<mat[i][j]<<" ";
        cout<<'\n';
    }*/
    for(int i=1; i<=m; ++i)
    {
        int st, dr;
        in>>st>>dr;
        int len=dr-st+1;
        int p=log2(len);
        int res = min(mat[st][p], mat[dr-(1<<p)+1][p]);
        out<<res<<'\n';
        //cout<<mat[st-1][dr]<<" si "<<mat[st-1][dr+(1<<st)]<<endl;
       // out<<min(mat[st-1][dr], mat[st-1][dr+(1<<(st-1))] )<<'\n';
    }
    return 0;
}