#include <fstream>
#define min(a,b) ((a<b) ? (a) : (b))

using namespace std;

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

void rmq();

int n, m, v[100005], a[100005][25];

int main()
{
    int i, k, st, dr;

    fin >> n >> m;
    for (i=1;i<=n;i++)
        fin >> v[i];
    rmq();
    for (i=1;i<=m;i++)
    {
        fin >> st >> dr;
        for (k=0;(1<<(k+1)) <= (dr-st+1);k++);
        fout << min(a[st][k],a[dr-(1<<k)+1][k]) << '\n';
    }
    return 0;
}

void rmq()
{
    int i, j, k;

    for (i=1;i<=n;i++)
        a[i][0] = v[i];
    for (k=0;(1<<(k+1)) <= n;k++);
    for (j=1;j<=k;j++)
        for (i=1;i+(1<<j)-1<=n;i++)
            a[i][j] = min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
}