#include <fstream>
#include <cmath>

using namespace std;

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

const int NMAX = 1e5 + 1, LOGMAX = 20;
int v[NMAX];
int lg[LOGMAX];
int rmq[LOGMAX][NMAX];

int main()
{
    int n, m, i, j, len, diff;

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

    lg[1] = 0;
    for(i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;


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

    for(i = 1; i <= m; i++)
    {
        int st, dr;
        fin >> st >> dr;
        len = lg[dr - st + 1];
        diff = dr - st + 1 - (1 << len);
        fout << min(rmq[len][st], rmq[len][st + diff]) << '\n';
    }




    return 0;
}