#include <iostream>
#include <fstream>
#define DEBUG 1

using namespace std;

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

int rmq[100001][20];
int lg[100001];
int v[100001];

int main()
{
    int n, m;
    in >> n >> m;


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

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

    if(DEBUG)
    {
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; (j << 1) <= n; j++)
                cout << rmq[i][j] << ' ';
            cout << '\n';
        }
    }

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

    while(m--)
    {
        int i, j;
        in >> i >> j;
        i--;
        j--;
        int l = lg[j-i+1];
        out << min(rmq[i][l], rmq[j - (1 << l) + 1][l]) << '\n';
    }

return 0;
}