#include <bits/stdc++.h>
using namespace std;

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

int e[100005];
int rmq[18][100005];
int n, m;


int MakeE()
{
    int i;
    for(i=2;i<=100000;i++)
        e[i] = e[i/2] + 1;
}

void RMQ()
{
    int i, j, l;
    for(i=1;i<=e[n];i++)
    {
        l = (1 << i);
        for(j=1;j<=n-l+1;j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+l/2]);
    }
}

int main()
{
    int i, x, y;
    fin >> n >> m;
    for(i=1;i<=n;i++)
        fin >> rmq[0][i];
    MakeE();
    RMQ();
    for(i=1;i<=m;i++)
    {
        fin >> x >> y;
        int expo = e[y - x + 1];
        int l = (1 << expo);
        fout << min(rmq[expo][x], rmq[expo][y - l + 1]) << "\n";
    }
    return 0;
}