#include <bits/stdc++.h>

using namespace std;
const int N = 1e5+1;

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

int rmq[20][N],lg[N];

int main()
{
    int n,m;
    in >> n >> m;
    for (int i = 1; i<=n; i++)
        in >> rmq[0][i];
    lg[2] = 1;
    for (int i = 3; 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++)
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for (int i = 1; i<=m; i++)
    {
        int a,b,p;
        in >> a >> b;
        p = lg[b-a+1];
        out << min(rmq[p][a],rmq[p][b-(1<<p)+1]) << "\n";
    }
}