#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
#define MOD 1000000009

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

int n,m;
int v[100001];
int r[20][100001];
int e[100001];

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)fin >> v[i],r[0][i]=v[i];

    e[1]=0;
    e[2]=1;
    for(int i=3;i<=n;i++)e[i]=1+e[i/2];

    for(int i=1;(1<<i)<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            r[i][j]=r[i-1][j];
            if(j+(1<<(i-1))<=n)r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
        }
    }


    while(m--)
    {
        int st,dr;
        fin >> st >> dr;
        int len= e[dr-st+1];
        fout << min(r[len][st],r[len][dr-(1<<len)+1]) << "\n";
    }
}