#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int N = 100005;
const int L = 19;

long n, m, a[N], lg[N], rmq[L][N];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        fin>>a[i];
    lg[1] = 0;
    for(int i=2; i<=n; i++)
        lg[i] = lg[(i >> 1)] + 1;
    for(int i=1; i<=n; i++)
        rmq[0][i] = a[i];

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

    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>x>>y;

        l=lg[y-x+1];
        fout<<min(rmq[l][x],rmq[l][y-(1<<l)+1])<<'\n';
    }
    for(int i=1; i<=n; i++)
    return 0;
}