#include <bits/stdc++.h>
using namespace std;
#define MAX 100
int sp[MAX][MAX];
int lg[MAX];
int a[MAX];

int query(int i, int j)
{
    int len = j-i+1;
    int k = lg[j - i + 1];

    return min(sp[i][k], sp[i+len-(1<<k)][k]);
}

int main()
{
    ifstream fin( "rmq.in" );
    ofstream fout( "rmq.out" );
    int m, x, y;
    int n;
    fin >> n >> m;
    for( int i = 0; i < n; i++ )
      fin >> a[i];
    for( int i = 2; i <= MAX; i++ )
        lg[i] = 1 + lg[i / 2];

    for (int i = 0; i < n; i++)
        sp[i][0] = a[i];

    int k = lg[n];
    for (int j = 1; j <= k; j++) {
        for (int i = 0; (i + (1<<j)) <= n; i++) {
            sp[i][j] = min(sp[i][j - 1], sp[i + (1<<(j-1)) ][j-1]);
        }
    }
    for( int i = 0; i < m; i++ ){
      fin >> x >> y;
      fout << query( x - 1, y - 1 ) << "\n";
    }
    return 0;
}