#include <bits/stdc++.h>

using namespace std;

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

int n, m, rmq[20][100005], lg[100005], x, y;

int query (int x, int y)
{
    int k=lg[y-x];
    return min(rmq[k][x],rmq[k][y-(1<<k)+1]);
}

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