#include <iostream>

using namespace std;

#define NMAX 100002
#define LMAX 18

long rmq[LMAX][NMAX];
long n,m;
long lg[NMAX];
long a[NMAX];

int main()
{
    long i, j, l;
    cin >> n >> m;
    for(i = 1; i <= n; i++)
        cin >> a[i];

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

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

    for(i = 1; (1<<i) <= n; i++)
    {
        for(j = 1; j + (1<<i) - 1 <= n; j++)
        {
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
        }
    }

    long int x,y,sh;

    for(i = 1; i <= m; i++)
    {
        cin >> x >> y;
        cout << min(rmq[lg[y-x+1]][x], rmq[lg[y-x+1]][y + 1 - (1 << lg[y-x+1])]);
    }
    return 0;
}


/*#include <iostream>

using namespace std;

int x[10000], n;
int rmq[10000][10000];

void genmat(int y[])
{
    for(int i = 1; i <= n; i++)
    {
        rmq[i][i] = y[i];
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = i + 1; j <= n; j++)
        {
            if(y[j] < rmq[i][j-1])
                rmq[i][j] = y[j];
            else
                rmq[i][j] = rmq[i][j-1];
        }
    }
}

int main()
{
    int q, i, a, b;
    cin >> n >> q;
    for(i = 1; i <= n; i++)
        cin >> x[i];
    genmat(x);
    for(i = 1; i <= q; i++)
    {
        cin >> a >> b;
        cout << rmq[a][b] << endl;
    }
    return 0;
}
*/