#include <fstream>
#include <vector>
#include <queue>
#include <iostream>
#include <string>
#include <bitset>
using namespace std;

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

int n, m;
int mat[100005][25];
int bin[100005];
int query(int x, int y)
{
    int lg = x - y + 1;
    int k = bin[lg];
    return min(mat[x][k], mat[y - (1 << k) + 1][k]);
}
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        fin >> x;
        mat[i][0] = x;
    }
    bin[1] = 0;
    for (int i = 2; i <= n; i++)
        bin[i] = bin[i / 2] + 1;

    for (int k = 1; k < 20; k++)
        for (int i = 1; i + (1 << k) - 1 <= n; i++)
            mat[i][k] = min(mat[i][k - 1], mat[i + (1 << (k - 1))][k - 1]);

    while (m--)
    {
        int x, y;
        fin >> x >> y;
        fout << query(x, y) << "\n";    
    }
    return 0;
}