#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "rmq";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 100000 + 5;

int N, M;
int V[NMAX];
int RMQ[17][NMAX];
int p2[17];
int lg2[NMAX];

void build() {
    int i, j, p;

    for(i = 1; i <= N; i++)
        RMQ[0][i] = V[i];

    for(i = 1, p = 2; p <= N; i++, p *= 2)
        for(j = 1; j + p / 2 <= N; j++)
            RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + p / 2]);

    for(i = 2; i <= N; i++)
        lg2[i] = lg2[i / 2] + 1;

    p2[0] = 1;

    for(i = 1; i <= lg2[N]; i++)
        p2[i] = p2[i - 1] * 2;
}

int query(int x, int y) {
    int d = y - x + 1;
    int i = lg2[d];
    int p = p2[i];

    return min(RMQ[i][x], RMQ[i][y - p + 1]);
}

int main() {
    int i, x, y;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    for(i = 1; i <= N; i++)
        scanf("%d", &V[i]);

    build();

    while(M--) {
        scanf("%d%d", &x, &y);
        printf("%d\n", query(x, y));
    }

    return 0;
}