#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int NMAX = 100000;
const int CMAX = log2(NMAX) + 1;
int RMQ[NMAX][CMAX];
int query(int x, int y) {
    x--;
    y--;
    int lung = y - x + 1;
    int logLung = int(log2(lung));
    return min(RMQ[x][logLung], RMQ[y - (1 << logLung) + 1][logLung]);

}
int main()
{
    int n, numQueries, x, y;
    fin >> n >> numQueries;
    for(int i = 0; i < n; i++)
        fin >> RMQ[i][0];
    for(int j = 1; j <= int(log2(n)); j++)
        for(int i = 0; i + (1 << j) <= n; i++)
            RMQ[i][j] = min(RMQ[i][j-1], RMQ[i+1<<(j-1)][j-1]);
    for(int i = 0; i < numQueries; i++)
    {
        fin >> x >> y;
        fout << query(x,y) << "\n";
    }
    return 0;

}