#include <iostream>
#include <fstream>
#include <math.h>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n , m , x , y;
int v[100001];
int dp[100001][21];

void rmq(){
    for(int i = 1 ; i <= n ; ++i)
        dp[i][0] = v[i];
    for(int i = 1 ; (1 << i) <= n ; ++i)
        for(int j = 1 ; j + (1 << i) - 1 <= n ; ++j)
            dp[j][i] = min(dp[j][i - 1] , dp[j + (1 << (i - 1))][i - 1]);
}

void query(int x , int y){
    int w = log2(y - x + 1);
    g << min(dp[x][w] , dp[y - (1 << w) + 1][w]) << "\n";
}

int main()
{
    f >> n >> m;
    for(int i = 1 ; i <= n ; ++i)
        f >> v[i];
    rmq();
    for(int i = 1 ; i <= m ; ++i){
        f >> x >> y;
        query(x , y);
    }
    return 0;
}