#include <bits/stdc++.h>

#define INF 1000000000

using namespace std;

ifstream fin("rmq.in");

ofstream fout("rmq.out");

int rsp[17][100010];

int n, m;

int e[100010];

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> rsp[0][i];
    }
    for (int p = 1; (1 << p) <= n; p++)
    {
        for (int i = 1; i <= n; i++)
        {
            rsp[p][i] = rsp[p - 1][i];
            int j = i + (1 << p - 1);
            if (j <= n && rsp[p][i] > rsp[p - 1][j])
                rsp[p][i] = rsp[p - 1][j];
        }
    }
    e[1] = 0;
    for (int i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];
    for(int i=1;i<=m;i++)
    {
        int st,dr;
        fin>>st>>dr;
        int pow=e[dr-st+1];
        int minim=INF;
        minim=min(rsp[pow][st],rsp[pow][dr-(1<<pow)+1]);
        fout<<minim<<'\n';
    }
}