#include <cstdio>

using namespace std;

const int NMAX = 100001,
          KMAX = 17;
int D[KMAX][NMAX];
char lg[NMAX];

inline int min(int a, int b) {
    return (a < b) ? a : b;
}
int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    int N, M, x, y;
    scanf("%i %i", &N, &M);
    lg[0] = -1;
    for(int i = 1; i <= N; i++) {
        scanf("%i", &D[0][i]);
        lg[i] = lg[i >> 1] + 1;
    }
    lg[0] = 0;

    for(int i = 1; (1 << i) <= N; i++) {
        x = i - 1;
        for(int j = 1; j + (1 << i) - 1 <= N; j++)
            D[i][j] = min(D[x][j], D[x][j + (1 << x)]);
    }

    while(M--) {
        scanf("%i %i", &x, &y);
        int l = lg[y-x];
        printf("%i\n", min(D[l][x], D[l][y - (1 << l) + 1]));
    }
    return 0;
}