#include <iostream>
#include <fstream>
#include <cmath>
#define MAX 100002
using namespace std;

int n,m,a[MAX],x,y,m[MAX][102];



int main(void)

{

	ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++){
        m[i][0] = a[i];
    }

    for(int j = 1; j <= log2(n); j++){
        for(int i = 1; i+(1<<(j-1)) <= n; i++){
            m[i][j] = min(m[i][j-1], m[i+(1<<(j-1))][j-1]);

        }

    }

    for(int i = 1; i <= m; i++){
        cin >> x >> y;
        int len = y-x+1;
        int LOG = log2(len);
        fout << min(st[x][LOG], st[y-(1<<LOG)+1][LOG]) << endl;

    }


}