#include <fstream>
#include <cmath>
#define nMax 100005

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

int n, q, a[nMax], lg[nMax], m[nMax][20], puteri[20];

int main()
{
    fin >> n >> q;
    for(int i=1; i<=n; i++)
        fin >> a[i];
    for(int i=1; i<=n; i++)
        m[i][0]=a[i];
    lg[1]=0;
    for(int i=2; i<=n; i++)
        lg[i]=lg[i/2]+1;
    puteri[0]=1;
    for(int i=1;i<=lg[n];i++)
     puteri[i]=puteri[i-1]*2;
    for(int j=1; j<=lg[n]; j++)
        for(int i=1; i+puteri[j]-1<=n; i++)
            m[i][j]=min(m[i][j-1], m[i+puteri[j-1]][j-1]);
    while(q--)
    {
        int l, r;
        fin >> l >> r;
        int mid=lg[r-l+1];
        fout << min(m[l][mid], m[r-puteri[mid]+1][mid]) << "\n";
    }
    return 0;
}