#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX = 1e5 + 1, LOG = 17;
int n, q, arr[NMAX];

class RangeMinimumQuery
{
private:
    int rmq[LOG][NMAX];
public:
    void build()
    {
        memcpy(rmq[0], arr, sizeof(arr));
        for(int i = 1; i < LOG; i++)
            for(int j = 1; j + (1 << (i - 1)) <= n; j++)
                rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    }
    int query(int st, int dr)
    {
        int e = 31 - __builtin_clz(dr - st + 1);
        return min(rmq[e][st], rmq[e][dr - (1 << e) + 1]);
    }
};
RangeMinimumQuery rmq;

int main()
{
    fin >> n >> q;
    for(int i = 1; i <= n; i++)
        fin >> arr[i];
    rmq.build();
    while(q--)
    {
        int st, dr;
        fin >> st >> dr;
        fout << rmq.query(st, dr) << "\n";
    }

    fin.close();
    fout.close();
    return 0;
}