#include <bits/stdc++.h>

using namespace std;
int n;
int v[100001];
int logs[100001];
int rmq[18][100001];
void RMQ(){
    int i,j;
    for(i = 2;i <= n;i++)
        logs[i] = logs[i / 2] + 1;
    for(i = 1;i <= logs[n];i++){
        int lung = (1 << i);
        for(j = 1;j + lung - 1 <= n;j++){
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j + lung / 2]);
        }
    }
}
int getmin(int a,int b){
    int cv = logs[b - a + 1];
    int lung = (1 << cv);
    return min(rmq[cv][a],rmq[cv][b - lung + 1]);
}
int main()
{

    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int i,m;
    cin >> n >> m;
    for(i = 1;i <= n;i++){
        cin >> rmq[0][i];
    }
    RMQ();
    while(m--){
        int a,b;
        cin >> a >> b;
        cout << getmin(a,b) << "\n";
    }
    return 0;
}