#include <iostream>
#include <fstream>
using namespace std;

const int NMAX = 100000;

int sp[25][NMAX + 10], v[NMAX + 10], lg[NMAX + 10];

void make_log()
{
    for(int i = 2; i <= NMAX; i++)
        lg[i] = 1 + lg[i / 2];
}

void buildSparseTable(int arr[], int n)
{
    for(int i = 0; i < n; i++)
        sp[0][i] = arr[i + 1];
    int k = lg[n];
    for(int j = 1; j <= k; j++)
        for(int i = 0; (i + (1 << j)) - 1 < n; i++)
            sp[j][i] = min(sp[j - 1][i], sp[j - 1][i + (1 << (j - 1))]);
}

int query(int i, int j)
{
    int k = lg[j - i + 1];
    return min(sp[k][i-1], sp[k][j - (1 << k)]);
}

int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n, m, x, y;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    make_log();
    buildSparseTable(v, n);
    for(int i = 1; i <= m; i++)
    {
        cin >> x >> y;
        cout << query(x, y) << '\n';
    }
    return 0;
}