#include <fstream>
#define MAX 100000

using namespace std;

int v[MAX];
int sp[MAX][20];
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 main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n,m;
    int a,b;
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>v[i];
    buildSparseTable(v,n);
    for(int i=0;i<m;i++)
    {
        cin>>a>>b;
        a--;
        b--;
        cout<<query(a,b)<<'\n';
    }
    return 0;
}