#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int Nmax = 100000 + 5;
int a[Nmax], rmq[20][Nmax], l[Nmax], n , m;
int main()
{
    fin >> n >> m;
    for(int i = 2; i <= n; ++i)l[i] = l[i / 2] + 1;
    for(int i = 1; i <= n; ++i)
        fin >> a[i], rmq[0][i] = a[i];
    for(int i = 1; i <= l[n]; ++i)
        for(int lg = 1; lg <= n - (1 << i) + 1; ++lg)
            rmq[i][lg] = min(rmq[i - 1][lg], rmq[i - 1][lg + (1 << (i- 1))]);
    for(int i = 1, x , y; i <= m; ++i)
    {
        fin >> x >> y;
        int len = l[y - x  + 1];
        fout << min(rmq[len][x], rmq[len][y - (1 << len) + 1]) << '\n';
    }
    return 0;
}