#include <bits/stdc++.h>

using namespace std;
ifstream fin ("rmq.in"); ofstream fout("rmq.out");
int lg[1000001], rmq[30][100004], n, m, x, y;

int querry(int a, int b)
{
    int k = lg[b - a];
    return min(rmq[k][a], rmq[k][b - (1 << k) + 1]);
}

void build()
{
    lg[1] = 0;
    for(int i = 2; i <= n; i ++) lg[i] = lg[i / 2] + 1;

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

    for(int i = 1; i <= lg[n]; i ++)
        for(int j = 1; j <= n; j ++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

int main()
{
    fin >> n >> m;
    build();
    for(int i = 1; i <= m; i ++)
        fin >> x >> y, fout << querry(x, y) << '\n';
    return 0;
}