#include <bits/stdc++.h>
using namespace std;

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

const long long NMAX = 1e5+5, MOD = 1e9 + 7, INF = 1e9;
int n, q;
int arr[NMAX];
int rmq[18][NMAX];

int main()
{

    f >> n >> q;

    for(int i = 1; i <= n; ++ i)
        f >> rmq[0][i];

    for(int i = 1; (1 << i) <= n; ++ i)
    {
        for(int j = 1; j <= n; ++ j)
        {
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i - 1))]);
        }
    }
    while(q--)
    {
        int a, b;
        f >> a >> b;
        int k = log2(1 + b - a);
        g << min(rmq[k][a], rmq[k][1 + b - (1<<k)]) << '\n';
    }
}