#include <iostream>
#include <cstdio>

#define MAXN (int)1e5+5
#define MAXLOGN 20
#define MAXM (int)1e6+6
#define mbs (1024.0D * 1024.0D)
#define inf 0x3f3f3f3f

#define fs fscanf
#define fp fprintf

using namespace std;

FILE *f, *g;

int v[MAXN];
int dp[MAXN][MAXLOGN];
int n, m, i, j, lg, x, y;

int query(int x, int y)
{
    int p, minim = inf;
    for(p = 20; p > 0; p --)
    {
        if((1 << p) <= y - x + 1)
        {
            return minim = min(v[ dp[y - (1 << p) + 1][p] ], v[dp[x][p]]);
        }
    }
    return v[x];
}

int main()
{
    f = fopen("rmq.in", "r");
    g = fopen("rmq.out", "w");

    fs(f, "%d%d", &n, &m);
    for(i = 1; i <= n; i ++)
    {
        fs(f, "%d", &v[i]);
        dp[i][0] = i;
    }

    for(j = 1, lg = 2; lg <= n; j ++, lg = lg << 1)
    {
        for(i = 1; i <= n - lg + 1; i ++)
        {
            dp[i][j] = (v[dp[i][j-1]] < v[dp[i+(lg >> 1)][j-1]] ? dp[i][j-1] : dp[i+(lg >> 1)][j-1]);
        }
    }

    for(i = 1; i <= m; i ++)
    {
        fs(f, "%d%d", &x, &y);
        fp(g, "%d\n", query(x, y));
    }

    fclose(f);
    fclose(g);
    return 0;
}