#include <iostream>
#include<bits/stdc++.h>

using namespace std;

#define n_max 100001

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int v[n_max];
int m[n_max][(int)log2(n_max)];
int lg[100001];
int n;


long long putere(int x)
{
    long long rez = 1;
    while(x)
    {
        rez = rez*2;
        x--;
    }
    return rez;
}

void procces(int v[n_max],int m[n_max][(int)log2(n_max)],int n)
{
    int i,j;
    for(i = 1;i<=n;i++)
        m[0][i] = v[i];
    for(i=1;putere(i)<=n;i++)
        for(j=1;j+putere(i)-1<=n;j++)
            m[i][j] = min(m[i-1][j],m[i-1][j+putere(i-1)]);
}



int main()
{
    int p;
    int log;
    int prim,sec;
    fin>>n>>p;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    procces(v,m,n);
    for(int i=0;i<p;i++)
    {
        fin>>prim>>sec;
        log = (int)log2(sec-prim+1);
            fout<<min(m[log][prim],m[log][sec-putere(log)+1])<<"\n";
    }



    return 0;
}