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

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

const int NMAX = 1e5 + 5, LOG = 18;
int n, q;
int rmq[NMAX][LOG];

int main()
{
    fin >> n >> q;
    for(int i = 1; i <= n; ++ i)
        fin >> rmq[i][0];
    for(int i = 1; (1 << i) <= n; ++ i)
    {
        for(int j = 1; j + (1<<i)-1 <= n; ++ j)
        {
            rmq[j][i] = min(rmq[j][i-1], rmq[j + 1 << (i - 1)][i - 1]);
        }
    }
    while(q--)
    {
        int a, b;
        fin >> a >> b;
        int k = log2(b - a + 1);
        fout << min(rmq[a][k], rmq[1 + b - (1<<k)][k]) << '\n';
    }
}