#include <fstream>
using namespace std;
ofstream out("rmq.out");
ifstream in("rmq.in");
const int N_MAX = 100000;
const int L_MAX = 18;

int rmq[L_MAX][N_MAX+1];
int log2[N_MAX];

int main()
{
    int n, m;
    in >> n >> m;
    log2[1] = 0;
    for(int i=2; i<=n; i++)
        log2[i] = log2[i/2]+1;
    for(int i=1; i<=n; i++)
        in >> rmq[0][i];
    for(int i=1; (1 << i) <= n; i++)
        for(int j=1; j <= n - (1<<i) + 1; j++)
        {
            int l = 1<<(i-1);
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+l]);
        }
    for(int i=1; i<=m; i++)
    {
        int p,q;
        in >> p >> q;
        int diff = q-p+1;
        int l = log2[diff];
        int r = diff - (1<<l);
        out << min(rmq[l][p], rmq[l][p+r]) << "\n";
    }

    return 0;
}