#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int v[100100];
int rmq[100100][20];
/// rmq[i][j] cel mai mic element din secventa cu capatul stanga in i si capatul dreapta in i + (1 << j) - 1
int logaritm[100100];
int x, y;

void precalc()
{
    for(int i = 1; i <= n; i ++)
    {
        rmq[i][0] = i;
    }
    for(int j = 1; (1 << j) <= n; j ++)
    {
        for(int i = 1; i + (1 << j) - 1 <= n; i ++)
        {
            if(v[rmq[i][j-1]] < v[rmq[i + 1 << (j-1)][j-1]])
                rmq[i][j] = rmq[i][j-1];
            else
                rmq[i][j] = rmq[i + 1 <<(j-1)][j-1];
        }
    }
}

int ans(int x, int y)
{
    int lungime = y - x + 1;
    int logg = logaritm[lungime];
    return min(v[rmq[x][logg]],v[rmq[y - (1<<logg) + 1][logg]]);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        fin >> v[i];
    }
    logaritm[2] = 1;
    for(int i = 3; i <= 100050; i ++)
    {
        logaritm[i] = logaritm[i/2] + 1;
    }
    precalc();
    while(m--)
    {
        fin >> x >> y;
        fout << ans(x,y) << '\n';
    }
    return 0;
}