#include <bits/stdc++.h>


using namespace std;


class InParser
{

private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);

        }
        return buff[sp];
    }
public:
    InParser(const char *nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser &operator >> (int &n)
    {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }

        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser &operator >> (long long &n)
    {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }

        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser
{
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch)
    {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }

public:
    OutParser(const char *name)
    {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }

    ~OutParser()
    {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser &operator << (int vu32)
    {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser &operator << (long long vu64)
    {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser &operator << (char ch)
    {
        write_ch(ch);
        return *this;
    }

    OutParser &operator << (const char *ch)
    {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }

};
#define MAX_ELEM 0xfffffff
#define MAXN 1000005
#define MAXK 25
// sparse table
int st[MAXN][MAXK + 1], n, log_table[MAXN + 1];

void build(const std::vector<int> &input)
{
    for(int i = 0; i < n; ++i) {
        st[i][0] = input[i];
    }


    for (int j = 1; j <= MAXK; j++) {
        int limit = n - (1 << j);
        for (int i = 0; i <= limit; i++) {
            st[i][j] = std::min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
        }
    }


    log_table[1] = 0;
    for (int i = 2; i <= MAXN; i++) {
        log_table[i] = log_table[i >> 1] + 1;
    }

}

std::vector<int> rmq(const std::vector<int> &input,
                     const std::vector< std::pair<int, int> > &queries)
{
    n = input.size(); // input size
    std::vector<int> ans; // return vector
    ans.reserve(queries.size());

    build(input);

    for(std::pair<int, int> q : queries) {
        int left = q.first, right = q.second;
        int j = log_table[right - left + 1];
        int minimum = std::min(st[left][j], st[right - (1 << j) + 1][j]);
        ans.push_back(minimum);
    }

    return ans;
}


int main()
{
    InParser in("rmq.in");
    OutParser out("rmq.out");

    int n, q;
    in >> n >> q;
    vector<int> input;
    input.reserve(n);
    vector<pair<int, int>> queries;
    queries.reserve(q);
    for(int i = 0; i < n; ++i) {
        int t;
        in >> t;
        input.push_back(t);
    }

    for(int i = 0; i < q; ++i) {
        int l, r;
        in >> l >> r;
        queries.push_back(make_pair(l - 1, r - 1));
    }

    vector<int> ans = rmq(input, queries);

    for(int i : ans) {
        out << i << "\n";
    }

}