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

ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, i, j, left, right, lg, k, l;
int lg1[100001], a[20][100001];

int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>a[0][i];
    lg1[1] = 0;
    for(i=2; i<=n; i++)
        lg1[i] = lg1[i/2]+1;
    for (i=1; i<=lg1[n]+1; i++)
    {
        for (j=1; j<=n-pow(2, i)+1; j++)
        {
            l=pow(2, i-1);
            a[i][j]= min(a[i-1][j], a[i-1][j+l]);
        }
    }
    for(i=1; i<=m; i++)
    {
        f>>left>>right;
        k = lg1[right-left+1];
        lg = pow(2, k);
        g<<min(a[k][left], a[k][right-lg+1])<<'\n';
    }
    return 0;
}