#include <fstream>
using namespace std;

int  n, m, i, j, x, y;
int a[1000];
int b[1000][1000];

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

int main()
{
    fin >> n >> m;
    for ( i = 1; i <= n; i++)
    {
        fin >> x;
        a.push_back(x);
    }    
    for ( i = 1; i < n; i++)
        for ( j = i; j <= n; j++)
        {
            if ( i ==  j)
                        b[i][j] = a[i];
            else
                        if ( a[j] < b[i][j-1])
                                                b[i][j] = a[j];
                        else
                                 
                                                 b[i][j] = b[i][j-1];
        }    
    i = 0;
    while ( i < m)
    {
        fin >> x >> y;
        fout << b[x][y] << '\n';
        i++;
    }
    fin.close();
    fout.close();
    return 0;
}