#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int nMax = 1e5 + 5;

int n, m;
int v[nMax], table[nMax][17], lg2[nMax];

int query(int x, int y){
    int length = y - x + 1;
    int k = lg2[length];

    return min(v[table[x][k]], v[table[x + length - (1 << k)][k]]);
}

int main()
{
    fin >> n >> m;

    for(int i = 0; i < n; i++){
        fin >> v[i];

        table[i][0] = i;
    }

    lg2[1] = 0;
    for(int i = 2; i < nMax - 4; i++)
        lg2[i] = 1 + lg2[i / 2];

    for(int j = 1; (1 << j) <= n; j++)
        for(int i = 0; i + (1 << j) - 1 < n; i++)
            if(v[table[i][j - 1]] < v[table[i + (1 << (j - 1))][j - 1]])
                table[i][j] = table[i][j - 1];
            else
                table[i][j] = table[i + (1 << (j - 1))][j - 1];

    for(int i = 1; i <= m; i++){
        int x, y;

        fin >> x >> y;

        fout << query(--x, --y) << "\n";
    }

    return 0;
}