#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 100005;
int n, m;
int rmq[nmax][20];
int lll[nmax];

void RMQ()
{
    int i, j;
    lll[1] = 0;
    for(i = 2;i <= n;i++)
        lll[i] = lll[i / 2] + 1;
    int N = lll[n];
    for(i = 1;i <= N;i++)
        for(j = 1;j <= n - (1 << i) + 1;j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
int Query(int a, int b)
{
    int len = b - a + 1;
    int p = lll[len];
    int rasp;
    rasp = min(rmq[p][a], rmq[p][b - (1 << p) + 1]);
    return rasp;
}
void Citire()
{
    int i;
    fin >> n >> m;
    for(i = 1;i <= n;i++)
        fin >> rmq[0][i];
    RMQ();
    for(i = 1;i <= m;i++)
    {
        int x, y;
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
}
int main()
{
    Citire();
    return 0;
}