#include <fstream>
#include <cmath>

using namespace std;

ifstream cin("rmq.in");
ofstream cout("rmq.out");

const int N = 1e5;
const int LOG = 15;
int dp[LOG + 5][N + 5];

int rmq(int st, int dr){
    int logaritm = log2(dr - st + 1);
    int p = (1 << logaritm);
    return min(dp[logaritm][dr], dp[logaritm][st + p - 1]);
}

int main() {
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> dp[0][i];
    int logarici = log2(n);
    for(int i = 1; i <= logarici; i++){
        int power = (1 << (i - 1));
        for(int j = power * 2; j <= n; j++){
            dp[i][j] = min(dp[i-1][j], dp[i-1][j - power]);
        }
    }
    for(int i = 0; i < m; i++){
        int st, dr;
        cin >> st >> dr;
        cout << rmq(st, dr) << '\n';
    }
    return 0;
}