#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int a[100005], n, m, p2[100005], rmq[25][200005];

void Rmq(){
    for(int i = 1; i <= n; i++)
        rmq[0][i] = a[i];
    for(int p = 1; (1 << p) <= n; p++)
        for(int i = 1; i + (1 << p) - 1 <= n; i++)
             rmq[p][i] = min(rmq[p-1][i], rmq[p-1][i + (1 << (p-1))]);
}

int main()
{
    int x, y, task;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
    }
    Rmq();
    p2[1] = 0;
    for(int i = 2; i <= n; i++)
        p2[i] = p2[i/2] + 1;
    for(int i = 1; i <= m; i++){
        fin >>  x >> y;
        int p = p2[y - x + 1];
        fout << min(rmq[p][x], rmq[p][y - (1 << p) + 1]) << "\n";
    }

    return 0;
}