#include <fstream>
#include <cmath>

using namespace std;

const int NMAX = 1e5;
const int MMAX = 1e6;

int a[NMAX + 1], n, m, x, y;
int rmq[NMAX + 1][20];

void prepr_rmq() {
    for(int j=1; (1 << j) <= n; j++)
        for(int i=0;i+(1 << j)-1<n;i++)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);

}


int query (int x, int y) {
    int k = log2(y - x + 1);
    return min(rmq[x][k], rmq[y - (1 << k) + 1][k]);
}


int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>rmq[i][0];

    prepr_rmq();

    for(int i=0;i<m;i++) {
        int x,y;
        cin>>x>>y;
        cout<<query(x-1,y-1)<<endl;
    }

    return 0;
}