#include <bits/stdc++.h>
using namespace std;
const int Nmax = 100005;
int rmq[17][Nmax], lg[18]; // rmq[i][nr] = valoarea minima pe intervalul (nr, nr+ (1<<i))
int main() {
    int n, q;
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    /*lg[1]=0;
    for (i=2;i<=n;i++) lg[i]=lg[i/2]+1; */
    fin >> n >> q;
    for(int i=1;i<=n;i++)
        fin >> rmq[0][i];
    for(int i=1;(1<<i)<=n;i++)
        for(int nr=1;nr<=n-(1<<i)+1;nr++)
            rmq[i][nr] = min(rmq[i-1][nr],rmq[i-1][nr+(1<<(i-1))]);
    /*for (i=1;(1<<i)<=n;i++)
		for (j=1;j <= n - (1 << i)+1;j++){
		l=1<<(i-1);
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}*/
    while(q--) {
        int x, y;
        fin >> x >> y;
        if (x<y) swap(x,y);
        int i=0;
        while ((x-y+1)<=(1<<i)) i++;
        fout << min(rmq[i][x],rmq[i][y-(1<<i)+1]) << "\n";
    }
    return 0;
}