#include <fstream>
#include <vector>
#include <list>
#include <queue>

using namespace std;

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

int  n, m, op, x, y, k, s, v;
int a[50001], viz[100001];
vector<int> G[100001];


int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        f >> a[i];
    }
    while (m--)
    {
        f >> x >> y;
        int min = a[x];
        for (int k = x + 1; k <= y; k++)
            if (a[k] < min) min = a[k];
        g << min << '\n';
    }

    return 0;
}