#include <bits/stdc++.h>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");
//#define f cin
//#define g cout

const int dim = 1e5 + 2;

int n, q;

int main()
{
    int i, j, x, y;

    f >> n >> q;

    vector < vector <int> > a(22);
    a[0].resize(n);

    for(auto& it: a[0])
        f >> it;

    for(i = 1; (1 << i) <= n; ++i){
        a[i].resize(n);

        for(j = 0; j + (1 << i) - 1 < n; ++j)
            a[i][j] = min(a[i - 1][j], a[i - 1][j + (1 << (i - 1))]);
    }

    vector <int> log(dim, 0);

    for(i = 2; i <= n; ++i)
        log[i] = log[i >> 1] + 1;

    for(i = 1; i <= q; ++i){
        f >> x >> y;
        --x, --y;
        int k = log[y - x + 1];
        g << min(a[k][x], a[k][y - (1 << k) + 1]) << '\n';
    }

    return 0;
}