#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <climits>
#include <bitset>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int a[101], lg[1000], rmq[100][100];

int main()
{
    int n, m, p, l, diff, x, y, sh;
    f >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        f >> a[i];
    }
    for (int i = 2; i <= n; i++)
    {
        lg[i] = lg[i / 2] + 1;
    }
    for (int i = 1; i <= n; i++)
    {
        rmq[0][i] = a[i];
    }
    for (int i = 1; pow(2, i) <= n; i++)
    {
        for (int j = 1; j <= n - pow(2, i) + 1; j++)
        {
            l = pow(2, i - 1);
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + 1]);
        }
    }
    for (int i = 1; i <= m; i++)
    {
        f >> x >> y;
        diff = y - x + 1;
        l = lg[diff];
        sh = diff - pow(2, l);
        cout << min(rmq[l][x], rmq[l][x + sh]) << "\n";
    }
    return 0;
}