#include <bits/algorithmfwd.h>
#include <fstream>
#define oo 2e9
using namespace std;

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

int n, m, rmq[1005][1005], k, a[1005];
int st, dr;

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    for(int i = 1; i <= n; i++)
        rmq[i][i] = a[i];
    for(int k = 2; k <=n ;k++)
        for(int i = 1; i + k - 1 <= n; i++)
        {
            int j = i + k - 1;
            rmq[i][j] = rmq[i][j-1];
            if(a[j] < rmq[i][j]) rmq[i][j] = a[j];
        }

    while(m--)
    {
        fin >> st >> dr;
        fout << rmq[st][dr] << '\n';
    }

    return 0;
}