#include <bits/stdc++.h>
#include <unordered_map>
#define nmax 100006
#define MOD 1999999973
#define INF 2012345678
#define ll long long
using namespace std;
//#define fin cin
//#define fout cout

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

int n;
int rmq[18][nmax];
int e[nmax];

void MakeE()
{
    for (int i = 2; i <= 100000; i++)
        e[i] = e[i / 2] + 1;
}

void RMQ()
{
    int i, j, L;

    for (i = 1; i <= e[n]; i++)
    {
        L = (1 << i);
        for (j = 1; j <= n - L + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L / 2]);
    }
}

int main()
{
    int i, j, L, expo, Q;
    fin >> n >> Q;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];

    MakeE();
    RMQ();

    while (Q--)
    {
        fin >> i >> j;
        expo = e[j - i + 1];
        L = (1 << expo);
        fout << min(rmq[expo][i], rmq[expo][j - L + 1]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}