#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q;
int a[20][100001];
int main()
{
    int i,j,k,l;
    f>>n>>q;
    for(int i = 1; i <= n; i++) f >> a[0][i];

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

    while(q--)
    {
        int x, y;
        f >> x >> y;

        int k = log2(y - x + 1);

        g << min(a[k][x], a[k][y - (1 << k) + 1]) << "\n";
    }
    return 0;
}