#include <bits/stdc++.h>
#include <fstream>
using namespace std;
#define MAX 500

int sp[MAX][MAX];
int lg[MAX];
int a[MAX];
void buildSparseTable(int arr[], int n)
{
    for (int i = 0; i < n; i++)
        sp[i][0] = arr[i];

    int k = lg[n];
    for (int j = 1; j <= k; j++) {
        for (int i = 0; (i + (1<<j))-1 < n; i++) {
            sp[i][j] = min(sp[i][j - 1], sp[i + (1<<(j-1)) ][j-1]);
        }
    }
}

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 cin("rmq.in");
    ofstream cout("rmq.out");
    int nop,mop,aaa,bbb;
    cin>>nop>>mop;
    for(int i=0;i<nop;i++)
        cin>>a[i];
    for(int i=2; i<=MAX; i++)
        lg[i] = 1 + lg[i/2];

    buildSparseTable(a, nop);

    for(int i=0;i<mop;i++)
    {
        cin>>aaa>>bbb;
        cout<<query(aaa-1, bbb-1)<<'\n';
    }
    return 0;
}