#include <fstream>
#include <cmath>
using namespace std;

ifstream cin("rmq.in");
ofstream cout("rmq.out");

int v[100005], n;
int spars[18][100005];
int intrebari;
int a, b;
int main()
{
    cin >> n >> intrebari;
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i];
        spars[0][i] = v[i];
    }
    int k = int (log2(n));
    int mult = 1;
    for(int i = 1; i <= k; i++)
    {
        mult*=2;
        for(int j = 1; j <= n; j++)
            spars[i][j] = min(spars[i-1][j], spars[i-1][j + mult/2]);


    }
    for(int i = 1; i <= intrebari; i++)
    {
        cin >> a >> b;
        int lg = max(a,b) - min(a,b) + 1;
        int k = int(log2(lg));
        mult = 1;
        for(int j = 1; j <= k; j++)
            mult = mult * 2;
        cout << min(spars[k][a], spars[k][b-mult+1])<<'\n';
    }
    return 0;
}