#include <bits/stdc++.h>

using namespace std;
int logs[100001];
int n,m;
int sparse[18][100001];
int v[100001];
void precalculate(){
    logs[1] = 0;
    for(int i = 2;i <= n;i++){
        logs[i] = logs[i/2] + 1;
    }
}
void build(){
    for(int i = 0;i <= logs[n];i++){
        int lungime = (1 << i);
        for(int j = 1;j + lungime <= n + 1;j++){
            if(lungime != 1)
                sparse[i][j] = min(sparse[i - 1][j],sparse[i-1][j + lungime / 2]);
            else
                sparse[0][j] = v[j];
        }

    }
    sparse[0][n] = v[n];
}
int getmin(int l,int r){
    int p = logs[r - l + 1];
    return min(sparse[p][l],sparse[p][r - (1 << p) + 1]);
}
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int i,j,x,y;
    cin >> n >> m;
    for(i  =1;i <= n;i++){
        cin >> v[i];
    }
    precalculate();
    build();
    for(i = 1;i <= m;i++){
        cin >> x >> y;
        cout << getmin(x,y) << "\n";
    }
    return 0;
}