#include <bits/stdc++.h>

using namespace std;

const int NRCHAR = 131072;
class Parsare
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        sp++;
        if(sp == NRCHAR)
        {
            sp = 0;
            fread(buff, 1, NRCHAR, fin);
        }
        return buff[sp];
    }

public:
    Parsare(const char *nume)
    {
        fin = fopen(nume, "r");
        buff = new char[NRCHAR]();
        sp = NRCHAR - 1;
    }
    template<class T>
    Parsare &operator >> (T &n)
    {
        char c;
        while(!isdigit(c = read_ch()));
        n = c - '0';

        while(isdigit(c = read_ch()))
            n = n * 10 + c - '0';
        return *this;
    }
};
Parsare fin("rmq.in");

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& 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;
    }
};

OutParser fout("rmq.out");

int rmq[17][100005];
int lg2[100005];
int pow2[17];

int main() {
    int i,j,n,q,limit,lf,rg;
    fin>>n>>q;
    lg2[2] = 1;
    for(i = 3;i <= n;i++){
        lg2[i] = lg2[i>>1] + 1;
    }
    pow2[0] = 1;
    for(i = 1;i <= lg2[n];i++){
        pow2[i] = pow2[i-1]<<1;
    }
    for(i = 1;i <= n;i++){
        fin>>rmq[0][i];
    }
    for(j = 1;j <= lg2[n];j++){
        limit = n - ((1<<j) - 1);
        for(i = 1;i <= limit;i++){
            rmq[j][i] = min(rmq[j-1][i], rmq[j-1][i + pow2[j-1]]);
        }
    }
    for(i = 1;i <= q;i++){
        fin>>lf>>rg;
        limit = lg2[rg - lf + 1];
        fout<<min(rmq[limit][lf], rmq[limit][rg - pow2[limit] + 1])<<'\n';
    }
    return 0;
}