#include <iostream>
#include <fstream>

using namespace std;

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

const int nmax=100001, log_nmax=17;
int precalc[nmax][log_nmax], logs[nmax];

int query(int x, int y)
{
    return min(precalc[x][logs[y-x+1]], precalc[y-(1<<logs[y-x+1])+1][logs[y-x+1]]);
}

int main()
{
    int n, m;
    fin >> n >> m;
    for(int i=2; i<=n; i++)
        logs[i]=logs[i/2]+1;
    for(int i=1; i<=n; i++)
        fin >> precalc[i][0];
    for(int j=1; (1<<j)<n; j++)
        for(int i=1; i<n; i++)
            precalc[i][j]=min(precalc[i][j-1],precalc[i+(1<<(j-1))][j-1]);
    int x, y;
    for(int i=0; i<m; i++)
    {
        fin >> x >> y;
        fout << query(x, y) << '\n';
    }
    return 0;
}