#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

int N, M;
int D[20][100001];

void precalc()
{
    for(int i = 1; (1 << i) <= N; i++)
    {
        int bound = N - (1 << i) + 1; // N - 2^j + 1
        for(int j = 1; j <= bound; j++)
            D[i][j] = min(D[i - 1][j], D[i - 1][j + (1 << (i - 1))]);
    }
}

int RMQ(int x, int y)
{
    //RMQ(x,y)=min(D[k][x],D[k][y - 2^k + 1])
    //2^k <= y-x, k maxim
    if(x==y)
        return D[0][x];
    int dif = y - x;
    int k = 0;
    for(; 1 << k <= dif; k++);
    k--;
    return min(D[k][x], D[k][y - (1 << k) + 1]);
}

int main()
{
    f >> N >> M;
    for(int i = 1; i <= N; i++)
        f >> D[0][i];
    precalc();
    while(M--)
    {
        int x, y;
        f >> x >> y;
        g<<RMQ(x,y)<<'\n';
    }
    return 0;
}