#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int i,mi,n,a[100002],m[18][100002],j,x,y,lg[100002];

int main() {
    f >> n >> mi;
    for (i=1;i<=n;i++) {
        f >> a[i];
        m[0][i]=a[i];
    }
    lg[1]=0;
    for (i=2;i<=n;i++) lg[i]=lg[i/2]+1;
    for (j=1;(1<<j)<=n;j++) {
        for (i = 1; i + (1 << j) - 1 <= n; i++)
              if (m[j-1][i] < m[j-1][i + (1 << (j - 1))])
                  m[j][i] = m[j-1][i];
              else
                  m[j][i] = m[j-1][i + (1 << (j - 1))];
    }
    int k;
    for (i=1;i<=mi;i++) {
        f >> x >> y;
        k=lg[y-x+1];
        if (m[k][x]<=m[k][y-(1<<k)+1])
            g << m[k][x] << '\n';
        else
            g << m[k][y-(1<<k)+1] << '\n';
    }
    f.close();g.close();
    return 0;
}