#include <bits/stdc++.h>

using namespace std;

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

const int Dim = 100001;
const int LG = 20;

int rmq[LG][Dim];

int power[Dim];

int main()
{
    int n, m;

    fin >> n >> m;

    for (int i = 1; i <= n; i++)
    {
        fin >> rmq[0][i];
    }

    for (int i = 2; i <= Dim; i++)
    {
        power[i] = power[i / 2] + 1;
    }

    for (int i = 1; (1 << i) <= n; i++)
    {
        for (int j = 1; j + (1 << i) - 1 <= n; j++)
        {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }

    for (int i = 1; i <= m; i++)
    {
        int left, right;

        fin >> left >> right;

        int length = power[right - left + 1];

        fout << min(rmq[length][left], rmq[length][right - (1 << length) + 1]) << "\n";
    }

    return 0;
}