#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,x,y,e,len;
int arr[17][100010];
int E[100010];

int main()
{
    fin>>n>>m;
    for(int i = 2; i<=n; i++)
        E[i] += 1 + E[i/2];
    for(int i = 1; i<=n; i++)
        fin>>arr[0][i];
    for(int p = 1; (1<<p) <= n; p++){
        for(int i = 1; i<=n; i++){
            arr[p][i] = arr[p-1][i];
            int j = i + (1<<p-1);
            if(j<=n)
                if(arr[p][i] > arr[p-1][j])
                    arr[p][i] = arr[p-1][j];
        }
    }
    for(int i = 1; i<=m; i++){
        fin>>x>>y;
        e = E[y-x+1];
        len = 1<<e;
        fout<<min(arr[e][x],arr[e][y-len+1])<<'\n';
    }

    return 0;
}