#include <fstream>
#include <vector>

using namespace std;

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

const int LGMAX = 18;

int N, M;
vector <int> rmq[LGMAX + 5];

void BuildRmq()
{
    for(int i = 1; i <= LGMAX; i++)
    {
        if((1 << i) > rmq[0].size())
            break;

        for(int j = 0; j < rmq[0].size(); j++)
            if(j + (1 << i) > rmq[0].size())
                break;
            else
                rmq[i].push_back(min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]));
    }
}

int QueryRmq(int x, int y)
{
    if(x > y)
        swap(x, y);

    int l = y - x + 1;
    int k = 0;

    while((1 << k) <= l)
        k++;
    k--;

    return min(rmq[k][x], rmq[k][y - (1 << k) + 1]);
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= N; i++)
    {

        int x;
        fin >> x;
        rmq[0].push_back(x);

    }

    BuildRmq();

    for(int i = 1; i <= M; i++)
    {

        int x, y;
        fin >> x >> y;
        fout << QueryRmq(x - 1, y - 1) << '\n';

    }

    return 0;
}