#include <iostream>
#include <fstream>
using namespace std;

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

const int MAX = 100005;
int n, m, x, y;
int lg[MAX], rmq[20][MAX];

void read()
{
    in >> n >> m;

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

    for(int i = 2; i <= MAX; ++i)
        lg[i] = lg[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)
    {
        in >> x >> y;
        int pos = lg[y - x + 1];
        int val = min(rmq[pos][x], rmq[pos][y - (1 << pos) + 1]);

        out << val << "\n";
    }
}

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