#include <fstream>
#include <cmath>
#include <iostream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m;
int A[10100];
int B[10100][20];
int mini(int st,int dr)
{
    int l=dr-st+1;
    int k=(int)log(l);
    if (A[B[st][k]] <= A[B[dr - (1<<k)+1][k]])
        return A[B[st][k]];
    else
        return A[B[dr - (1<<k) + 1][k]];
}
int main()
{
    fin>>n>>m;
    for (int i=0; i<n; i++)
        fin>>A[i];
    for (int i=0; i<n; i++)
        B[i][0]=i;
    for (int j = 1; 1 << j <= n; j++)
    {
        for (int i = 0; i + (1 << j) - 1 < n; i++)
        {
            if (A[B[i][j - 1]] < A[B[i + (1 << (j - 1))][j - 1]])
                B[i][j]=B[i][j-1];
            else
                B[i][j] = B[i + (1 << (j - 1))][j - 1];
        }
    }
    for (int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        fout<<mini(x-1,y-1)<<"\n";
    }
    return 0;
}