#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");
int n, q, lg[200002], rmq[18][200002];

int main()
{
    f >> n >> q;
    for(int i = 1; i <= n; ++i)
        f >> rmq[0][i];
    for(int i = 2; i <= n; ++i)
        lg[i] = lg[i/2] + 1;
    for(int i = 1; i <= lg[n]; ++i)
        for(int j = 1; j + (1<<i) - 1 <= n; ++j)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);
    for(; q; --q)
    {
        int x, y;
        f >> x >> y;
        int va = lg[y - x + 1];
        g << min(rmq[va][x], rmq[va][y - (1<<va) + 1]) << '\n';
    }
    return 0;
}