#include <cstdio>
#include <vector>

using namespace std;
#define dmax 100003

int m[dmax][20], a[dmax], n, m2;
 int lg[dmax];

void rmq_def()
{

     lg[1]=0;
    for (int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

    for(int i=1; i<=n; i++)
        m[0][i]=a[i];

    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
        m[i][j]=min(m[i-1][j], m[i-1][j+(1<<(i-1))]);

}

void read()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    scanf("%i %i ", &n, &m2);
    for(int i=1; i<=n; i++)
        scanf("%i", &a[i]);

    rmq_def();
int a,b;
    for(int i=1; i<=m2; i++)
    {
        scanf("%i %i ", &a, &b);
        int l=lg[b-a+1];
        printf("%i\n", min(m[l][a], m[l][b-(1<<l)+1]));

    }

}

int main()
{
    read();
    return 0;
}