#include <iostream>
#include <fstream>
#include <vector>
#include <cassert>

using namespace std;

vector<int> log;
template<typename T>
class rmq
{
public:
    rmq(const vector<T> &vec)
    {
        v = vec;
        for(int i = 0; (1 << i) < v.size(); ++i)
            mn.push_back(vector<T>(v.size()));
        if(v.size() > log.size())
            SetLog();
        Update();
    }
    T Query(int st, int dr)
    {
        int partSize = log[dr - st + 1];
        return min(mn[partSize][st], mn[partSize][dr - (1 << partSize) + 1]);
    }
    void SetV(const vector<T> &vec)
    {
        assert(vec.size() == v.size());
        Update();
    }
private:
    void Update()
    {
        for(int i = 0; i < v.size(); ++i)
            mn[0][i] = v[i];
        for(int i = 1; (1 << i) < v.size(); ++i)
            for(int j = 0; j + (1 << (i - 1)) < v.size(); ++j)
                mn[i][j] = min(mn[i-1][j], mn[i-1][j + (1 << (i - 1))]);
    }
    void SetLog()
    {
        log.resize(v.size());
        log[1] = 0;
        for(int i = 2; i < v.size(); ++i)
            log[i] = log[i/2] + 1;
    }
    vector<T> v;
    vector<vector<T> > mn;
};

int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int n, m;
    in >> n >> m;
    vector<int> v(n);
    for(auto &x:v)
        in >> x;
    rmq<int> r(v);
    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        out << r.Query(x-1, y-1) << "\n";
    }

    return 0;
}