#include <fstream>

using namespace std;

ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int n, m, v[20][100005], w[100005], x, y;

int main()
{
    fin>>n>>m;
    for(int i = 1; i <= n; i++){
        fin>>v[0][i];
    }
    w[1] = 0;
    for(int i = 2; i <= 100000; i++){
        w[i] = w[i / 2] + 1;
    }
    for(int i = 1; i <= w[n] + 1; i++){
        int t = (1 << i);
        for(int j = 1; j <= n; j++){
            v[i][j] = v[i - 1][j];
            if(t / 2 + j <= n){
                v[i][j] = min(v[i][j], v[i - 1][t / 2 + j]);
            }
        }
    }
    for(int i = 1; i <= m; i++){
        fin>>x>>y;
        int dif = y - x + 1;
        int p = w[dif];
        int q = (1 << p);
        fout<<min(v[p][x], v[p][y - q + 1])<<"\n";
    }
    return 0;
}