#include <cstdio>
#define MAX 100000
#define LOG 19
using namespace std;
inline int minim(int a, int b)
{
    if(a<b)
        return a;
    return b;
}
int n, rmq[LOG][MAX+1], lg[MAX+1];
void calculate()
{
    for(int log=1;(1<<log)<=n;++log)
        for(int i=1; i+(1<<log)-1<=n; ++i)
            rmq[log][i]=minim(rmq[log-1][i], rmq[log-1][i+(1<<(log-1))]);
}
int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    int q, x, y;
    scanf("%d%d", &n, &q);
    for(int i=1;i<=n;++i)
        scanf("%d", &rmq[0][i]);
    lg[1]=0;
    for(int i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;
    calculate();
    for(int i=1;i<=q;++i)
    {
        int log;
        scanf("%d%d", &x,&y);
        log=lg[y-x+1];
        printf("%d\n", minim(rmq[log][x], rmq[log][y-(1<<log)+1]));
    }
    return 0;
}