#include <fstream>

#define NMAX 100005
#define LOGMAX 105

using namespace std;

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

int n, m;
int v[NMAX];
int dp[NMAX][LOGMAX];
int l, r;
int log[NMAX];
int i, j;

int rmq(int, int);

int main()
{
    log[1] = 0;
    for (i = 2; i < NMAX; ++i)
        log[i] = log[i/2] + 1;

    fin >>n>>m;
    for (i = 1; i <= n; ++i)
    {
        fin >>v[i];
        dp[i][0] = v[i];
    }

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

    for (i = 1; i <= m; ++i)
    {
        fin >>l>>r;
        fout <<rmq(l, r)<<'\n';
    }
    fout.close();
    return 0;
}

int rmq(int l, int r)
{
    int lg = log[r-l+1];
    int x = dp[l][lg];
    int y = dp[r-(1<<lg)+1][lg];
    return min(x, y);
}

/*
dp[i][0] = v[i];
dp[i][j] = min pt intervalul [i, i + 2^j-1];
dp[i][j] = min(dp[i][j-1], dp[i+2^(j-1)][j-1])

log = j-i+1
min(i...j) = min(dp[i][log], dp[i-(1<<log)+1][log])
*/