#include <fstream>
using namespace std;

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


    int n,m;
    fin>>n>>m;

    int log[n+1];

    log[1] = 0;
    for (int i = 2; i <= n; i++)
        log[i] = log[i/2] + 1;

    int logN=log[n];

    int minime[n+1][logN+1];
    for(int i=0;i<n;i++)
        fin>>minime[i][0];

    for(int j=1;j<=logN;j++)
        for(int i=0; i+(1<<j)<=n; i++){
            minime[i][j] = min(minime[i][j-1], minime[i+(1<<(j-1))][j-1]);
        }

    int stanga,dreapta;
    for(int i=0;i<m;i++){
        fin>>stanga>>dreapta;
        int p=log[dreapta-stanga+1];
        fout<<min(minime[stanga][p], minime[dreapta-(1<<p)][p])<<"\n";
    }

    fin.close();
    fout.close();
}