#include <bits/stdc++.h>
using namespace std;

class rmq{
    array<vector<int>, 20> buf;
public:
    rmq(const vector<int>& v1){
        buf[0] = v1;
        for(auto& x : buf) x.resize(v1.size());
        for(int i = 1, step = 1; i < 20; ++i, step *= 2)
            for(int j = 0, k = step; k < buf[i].size(); ++j, ++k)
                buf[i][j] = min(buf[i-1][j], buf[i-1][k]); }
    int query(int st, int dr){
        const int niv = log2(dr-st+1);
        return min(buf[niv][st], buf[niv][dr - (1<<niv) + 1]); } };

int main(){
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    int n, m;
    f >> n >> m;
    vector<int> v(n);
    for(auto& x : v) f >> x;
    rmq r(v);
    for(int i = 0, st, dr; i < m; ++i){
        f >> st >> dr;
        g << r.query(st-1, dr-1) << '\n'; }
    return 0; }