#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, a[100001], rmq[100001][16], x, y;
short log[100001];
int main()
{
    fin >> n >> m;
    for(int i = 1; i<= n; i++ )
    {
        fin>>a[i];
        rmq[i][0]=a[i];
        if ( i > 1 ) log[i] = log[i>>1]+1;
    }
    for(int j = 1; (1<<j) <= n; j++ )
        for(int i = 1; i+(1<<j)-1 <= n; i++ )
            rmq[i][j] = min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
    for(int i = 1;i<= m; i++ )
    {
        fin >> x >> y;
        int len = log[y-x+1];
        fout << min(rmq[x][len],rmq[y-(1<<len)+1][len])<<'\n';
    }
    fin.close();
    fout.close();
    return 0;
}