#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, x, y, i, st, dr, mi, rmq[17][1<<17];
int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++)
        f >> rmq[0][i];
    x=1;y=2;i=1;
    for(;y<=n;x<<=1,y<<=1,i++)
        for(st=1,dr=y,mi=x+1;dr<=n;st++,mi++,dr++)
            rmq[i][st] = min(rmq[i - 1][st], rmq[i - 1][mi]);
    for(; m; m--)
    {
        int Min = 100010;
        f >> x >> y;
        int l = y - x;
        while(l >= 0)
        {
            int  p = 1, line = 0;
            while(p < l)
                p *= 2, line++;
            Min = min(Min, rmq[line][x]);
            x += p;
            l -= p;
        }
        g << Min << "\n";
    }
    return 0;
}