#include <cstdio>
#include <algorithm>

using namespace std;

const int Nmax = 100010;

int n , m , x , y , k , i , j;
int D[18][Nmax];
int Log[Nmax];

void rmq()
{
    for (i = 1; i <= Log[n]; ++i)
     for (int half = (1 << (i - 1)) , j = 1; j <= n - (1 << i) + 1; ++j)
      D[i][j] = min(D[i-1][j] , D[i-1][j+half]);
}

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

    scanf("%d %d", &n, &m);

    for (Log[2] = 1 , i = 1; i <= n; ++i)
    {
        scanf("%d", &D[0][i]);
        if (i > 2) Log[i] = Log[i>>1] << 1;
    }

    for (rmq() ; m ; --m)
    {
        scanf("%d %d", &x, &y);

        k = Log[y-x+1]; int half = (1 << k);

        printf("%d\n", min(D[k][x] , D[k][y-half+1]));
    }

    return 0;
}