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

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

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

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