#include <bits/stdc++.h>
#define Nmax 100005

using namespace std;

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

int N, expo[Nmax], rmq[Nmax][20];

inline void RMQ()
{
    int i, j;
    for(j = 1; (1 << j) <= N; j++) {
        for(i = 1; i <= N - (1 << j) + 1; i++) {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
    expo[1] = 0;
    for(i = 2; i <= N; i++) {
        expo[i] = 1 + expo[i / 2];
    }
}

inline int Query(int x, int y)
{
    int E = expo[y - x + 1];
    return min(rmq[x][E], rmq[y - (1 << E) + 1][E]);
}

inline void Solve()
{
    int Q, i, x, y;
    fin >> N >> Q;
    for(i = 1; i <= N; i++)  {
        fin >> rmq[i][0];
    }
    RMQ();
    while(Q--)  {
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    fin.close();
    fout.close();
}

int main()
{
    Solve();
    return 0;
}