#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m;
int v[100005];

int dp[21][100000];


int RMQQuery(int lf, int rg)
{
    int logLen = log2(rg - lf + 1);
    return min(dp[logLen][lf], dp[logLen][rg - (1 << logLen) + 1]);
}


int main()
{
    fin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        fin >> v[i];
    }


    for (int i = 0; i < n; i++)
    {
        dp[0][i] = v[i];
    }

    for (int e = 1; e < 20; e++)
    {
        int len = 1 << e;
        for (int st = 0; st + len <= n; st++)
        {
            dp[e][st] = min(dp[e - 1][st], dp[e - 1][st + (1 << (e - 1))]);
        }
    }

    for (int e = 0; e < 20; e++)
    {
        int len = 1 << e;
        for (int st = 0; st + len <= n; st++)
        {
            cout << dp[e][st] << ' ';
        }
        cout << '\n';
    }

    for (int i = 0; i < m; i++)
    {
        int a, b;
        fin >> a >> b;

        fout << RMQQuery(a - 1, b - 1) << '\n';
    }

}