#include <fstream>
#define MAX 100000
#define LOG 20
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
int rmq[LOG + 10][MAX + 10], exp2[MAX + 10];
int main()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> rmq[0][i];
    for (int p = 1; p <= LOG; p++)
        for (int i = 1; i <= n; i++)
        {
            rmq[p][i] = rmq[p - 1][i];
            int j = i + (1 << (p - 1));
            if (j <= n)
                rmq[p][i] = min(rmq[p][i], rmq[p - 1][j]);
        }
    exp2[1] = 0;
    for (int i = 2; i <= n; i++)
        exp2[i] = exp2[i / 2] + 1;
    for (int i = 1; i <= q; i++)
    {
        int x, y;
        cin >> x >> y;
        int exp = exp2[y - x + 1];
        cout << min(rmq[exp][x], rmq[exp][y - (1 << exp) + 1]) << '\n';
    }
    return 0;
}