#include <iostream>
#include <fstream>
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

#define nmax 100005

int lg[nmax],rm[20][nmax],n,m,i,j;

void rmq()
{
    for(i = 2; i<=n; i++)
        lg[i] = lg[i/2] + 1;

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

int main()
{
    f >> n >> m;
    for(i = 1; i<=n; i++)
        f >> rm[0][i];

    rmq();

    for(i = 1; i<=m; i++)
    {
        int x,y;
        f >> x >> y;

        int p = lg[y - x + 1];
        g<<min(rm[p][x], rm[p][y - (1<<p) + 1])<<'\n';
    }

    return 0;
}