#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
FILE *f,*g;
int a[20][100002], log2[100002];
int n,m;
int minim(int a, int b)
{
    return a<b ? a:b;
}
void read()
{
    fscanf(f,"%d %d",&n,&m);
    for(int i=1; i<=n; i++)
        fscanf(f,"%d",&a[0][i]);
}
void Logarithm()
{
    for(int i=2; i<=n; i++)
        log2[i]=log2[i/2]+1;
}
void solve()
{
    for(int i=1; i<=log2[n];i++)
    {
        for(int j=1; j<=n-(1<<(i-1)); j++)
        {
            a[i][j]=minim(a[i-1][j], a[i-1][j+(1<<(i-1))]);
        }
    }
}
void write()
{   int x,y,k;
    for(int i=1; i<=m; i++)
    {
        fscanf(f,"%d %d",&x,&y);
        k=log2[y-x+1];
        fprintf(g,"%d\n",minim(a[k][x], a[k][y-(1<<k)+1]));
    }
}
int main()
{
    f=fopen("rmq.in","r");
    g=fopen("rmq.out","w");
    read();
    Logarithm();
    solve();
    write();
    fclose(f);
    fclose(g);
    return 0;
}