#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, m, x, y, p, q;
int matrix[30][100000];
int lg[12345];
int main()
{
    in>> n >> m;
    lg[1]=0;
    for(int i = 1; i <= n; ++i)
        in>> matrix[0][i];
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i/2] + 1;
    for(int i = 1;i <= lg[n]; ++i)
        for(int j = 1; j <= (n - (1 << i) + 1); ++j)
             matrix[i][j] = min(matrix[i - 1][j], matrix[i - 1][j + (1 << (i - 1))]);
    for(; m; --m)
    {
        in>> x >> y;
        p = lg[y-x+1];
        q = y - x + 1 - (1 << p);
        out<< min(matrix[p][x], matrix[p][x + q]) << "\n";
    }
    return 1e1234;
}

//This is RMQ !!!