#include <bits/stdc++.h>

using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");
int n, m, rmq[18][100001];

int query(int st, int dr)
{
    int r = log2(dr-st+1);
    return min(rmq[r][st], rmq[r][dr-(1<<r)+1]);
}

int main()
{
    in >> n >> m;

    for(int i = 1; i <= n; i++)
        in >> rmq[0][i];

    int rmax = log2(n);
    for(int r=1,l=1; r<=rmax; r++,l*=2)
        for(int i=1; i<=n-l*2+1; i++)
            rmq[r][i] = min(rmq[r-1][i], rmq[r-1][i+l]);

    for(int st, dr, k=1; k<=m; k++)
    {
        in >> st >> dr;
        out << query(st, dr) << '\n';
    }

    return 0;
}