#include <bits/stdc++.h>
using namespace std;
const int Nmax = 100005;
int rmq[17][Nmax], lg[17]; // rmq[i][nr] = valoarea minima pe intervalul (nr, nr+ (1<<i))
int main() {
    int n, q;
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    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+(1<<i)<=n+1;nr++)
            rmq[i][nr] = min(rmq[i-1][nr],rmq[i-1][nr+(1<<(i-1))]);
    while(q--) {
        int x, y, p;
        fin >> x >> y;
        if (x>y) swap(x,y);
        p=floor(log2(y-x+1));
        // cout << y-x+1 << " ";
        // cout << (1<<(p-1)) << " " << x << " " << (y-(1<<(p-1))+1) << "\n";
        fout << min(rmq[p][x],rmq[p][y-(1<<p)+1]) << "\n";
    }
    return 0;
}