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

using namespace std;

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

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

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

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

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

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