#include <iostream>
#include <fstream>
#include <math.h>

using namespace std;

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

const int SIZE = 100001;
const int LOG = 17;

int st[SIZE][LOG + 1];
short logarithm[SIZE];

void Query(int left, int right)
{
    int length = right - left + 1;
    int j = logarithm[length];
    g << min(st[left][j], st[right + 1 - (1 << j)][j]) << "\n";
}

int main()
{
    int n, q;

    f >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        f >> st[i][0];
    }

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

    logarithm[1] = 0;
    for (int i = 2; i <= SIZE; i++)
    {
        logarithm[i] = logarithm[i/2] + 1;
    }

    for (int i = 1; i <= q; i++)
    {
        int x, y;
        f >> x >> y;
        Query(x, y);
    }
}