#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

int n, m;
int sir[100005];
int x, y;
int rmq[100005][20];

void citire()
{
    scanf("%d %d", &n, &m);

    for(int i = 0; i < n; i++)
    {
        scanf("%d", &sir[i]);
    }
}

void construireMatriceInitiala()
{
    int lg = (int)log2(n);

    for(int i = 0; i < n; i++)
    {
        rmq[i][0] = sir[i];
    }

    for(int j = 1; j <= lg; j++)
    {
        for(int i = 0; i < n; i++)
        {
            int tmp1 = rmq[i][j - 1];
            int tmp2;

            int tmpx = i + (1 << (j - 1));

            if(tmpx >= n)
            {
                tmp2 = tmp1;
            }
            else
            {
                tmp2 = rmq[tmpx][j - 1];
            }


            rmq[i][j] = min(tmp1, tmp2);
        }
    }
}

void citireTest()
{
    scanf("%d %d", &x, &y);
    x--;
    y--;
}

void solve()
{
    int nr = (y - x + 1);
    int nrx = log2(nr);

    int tmp1 = rmq[x][nrx];
    int tmpx = y - (1 << nrx) + 1;
    int tmp2 = rmq[tmpx][nrx];

    printf("%d\n", min(tmp1, tmp2));
}

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

    citire();
    construireMatriceInitiala();

    for(int i = 0; i < m; i++)
    {
        citireTest();
        solve();
    }

    return 0;
}