#include <bits/stdc++.h>
using namespace std;
const int nmax = 100005;
int a[20][nmax], lg[nmax];
int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    int n, m, i, j, l, x, y, dif, sh;
    scanf("%d %d", &n, &m);
    for(i=1; i<=n; i++)
        scanf("%d", &a[0][i]);
    lg[1]=0;
    for(i=2; i<=n; i++)
        lg[i]=lg[(i>>1)]+1;
    for(i=1; (1<<i)<=n; i++)
        for(j=1; j<=n-(1<<i)+1; j++)
        {
            l=1<<(i-1);
            a[i][j]=min(a[i-1][j], a[i-1][j+l]);
        }
    while(m--)
    {
        scanf("%d %d", &x, &y);
        dif=y-x+1;
        l=lg[dif];
        sh=dif-(1<<l);
        printf("%d\n", min(a[l][x], a[l][x+sh]));
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}