#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 100000;
const int LGMAX = 17;

int n, q, st, dr;
int x;
int rmq[NMAX+1][LGMAX];
int calclog[NMAX+1];

int main()
{
    fin >> n >> q;
    for(int i=1; i<=n; i++)
        fin >> x, rmq[i][0] = x;
    for(int lg=1; lg<=LGMAX; lg++)  
        for(int i=1; i+(1<<(lg))<=n+1; i++)
            rmq[i][lg] = min(rmq[i][lg-1],rmq[i+(1<<(lg-1))][lg-1]);
    for(int i=2; i<=n; i++)
        calclog[i] = calclog[i/2]+1;
    while(q--)
    {
        fin >> st >> dr;
        int lg = calclog[dr-st+1]-1;
        fout << min(rmq[st][lg], rmq[1+dr-(1<<(lg))][lg]) << '\n';
    }
    return 0;
}