#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int nmax = 100005;
int lg[nmax];
int rmq[20][nmax];
int n, k;
void citire()
{
    in >> n >> k;
    for(int i = 1; i <= n; i ++)
        in >> rmq[0][i];
}

void build()
{
    for(int i = 1; i <= 17; 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 = 2; i <= nmax - 5; i++)
        lg[i] = 1 + lg[i>>1];
}

int query(int x, int y)
{
    int k = lg[y - x + 1];
    return min(rmq[k][x], rmq[k][y - (1 << k) + 1]);
}
int main()
{
    citire();
    build();
    for(int i = 1; i <= k; i ++)
    {
        int a, b;
        in >> a >> b;
        out << query(a, b) << '\n';
    }
    return 0;
}