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

int sp[MAX][MAX];
int lg[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 v[100005];
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n, m, a, b;
    cin>>n>>m;
    for(int i=0; i<n; i++) cin>>v[i];
    for(int i=2; i<=MAX; i++) lg[i]=1+lg[i/2];

    buildSparseTable(v, n);
    int k=lg[n];

    for(int i=0; i<m; i++)
    {
        cin>>a>>b;
        cout<<query(a-1, b-1)<<'\n';
    }
    /*
    for(int i=0; i<9; i++){
        for(int j=0; j<k; j++){
            cout<<sp[i][j]<<" ";
        }
        cout<<endl;
    }*/

    return 0;
}