#include <bits/stdc++.h>

using namespace std;

ifstream F("rmq.in");
ofstream G("rmq.out");

int n, m, x, y, v[100002], d[100002][18];

void make_dp()
{
    for(int i = 0; i < n; ++ i) d[i][0] = i;
    for(int j = 1; (1 << j) <= n; ++ j)
        for(int i = 0; i + (1 << j) - 1 < n; ++ i)
            if(v[d[i][j-1]] < v[d[i+(1 << (j-1))][j-1]])
                d[i][j] = d[i][j-1];
            else d[i][j] = d[i+(1 << (j-1))][j-1];
}

int rmq(int l, int h)
{
    int k, p = 0;
    int lng = h - l + 1;
    for(k = 1; k <= lng; k <<= 1, p ++);
    if(k > lng) k/= 2, p--;
    return min(v[d[l][p]], v[d[l + lng - (1 << p)][p]]);
}

int main()
{
    F >> n >> m;
    for(int i = 0; i < n; ++ i) F >> v[i];
    make_dp();
    for(int i = 1; i <= m; ++ i)
    {
        F >> x >> y;
        int ans = rmq(x-1, y-1);
        G << rmq(x-1, y-1) << '\n';
    }
    return 0;
}