#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int nmax = 100000;
int n,m;

int r[20][nmax + 5];

const int INF = 1e9;

int main()
{
    for (int p = 1; p < 20; p++)
        for (int i = 1; i <= n; i++)
            r[p][i] = INF;

    fin>>n>>m;
    for (int i = 1; i <= n; i++)
        fin>>r[0][i];
    for (int p = 1; (1<<p) <= n; p++)
        for (int i = 1; i + (1<<p) - 1 <= n; i++) {
            int l = (1<<(p-1));
            r[p][i] = min (r[p-1][i], r[p-1][i + l]);
        }
    for (int i = 1; i <= m; i++) {
        int st, dr;
        fin>>st>>dr;
        int p = 0;
        while (st + (1<<p) - 1 <= dr) ++p;
        --p;
        int rez = min (r[p][st], r[p][dr - (1<<p) + 1]);
        fout<<rez<<'\n';
    }
}