#include <iostream>
#include <fstream>
#include <cmath>

#define BUF_SIZE 100001
#define POW_SIZE 21

using namespace std;

int rmq[BUF_SIZE + 1][POW_SIZE];
int vec[BUF_SIZE + 1];
int n, q;

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

int query(int x, int y) 
{
    int n = y - x + 1;
    int p = log2(n);

    return min(rmq[x][p], rmq[y - (1 << p) + 1][p]);
}

void build()
{
    for(int i = 1; i <= n; i++)
        rmq[i][0] = vec[i];

    for(int j = 1; j <= int(log2(n)); j++) 
        for(int i = 1; i <= n - (1 << j) + 1; i++)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
}

int main() 
{
    fin >> n >> q;
    for(int i = 1; i <= n; i++) 
        fin >> vec[i];

    build();

    for(int i = 1; i <= q; i++) 
    {
        int x, y;
        fin >> x >> y;
        fout << query(x, y) << '\n';
    }

	return 0;
}