#include <bits/stdc++.h>

using namespace std;

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

const int nMax = 100005;
int n, m;
int rmq[nMax][20], Lg[nMax], a[nMax];

inline void RMQ()
{
    int i, j;
    for(i = 1; i <= n; i++)
        rmq[i][0] = a[i];
    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]);
    for(i = 2; i <= n; i++)
        Lg[i] = Lg[i / 2] + 1;
}

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

inline void Solve()
{
    int i, x, y;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        fin >> a[i];
    RMQ();
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
}

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