#include<vector>
#include<fstream>
using namespace std;

class InParser {
    vector<char> str;
    int ptr;
    ifstream fin;

    char getChar() {
        if (ptr == int(str.size())) {
            fin.read(str.data(), str.size());
            ptr = 0;
        }
        return str[ptr++];
    }

    template<class T>
    T getInt() {
        char chr = getChar();
        while (!isdigit(chr) && chr != '-')
            chr = getChar();
        int sgn = +1;
        if (chr == '-') {
            sgn = -1;
            chr = getChar();
        }
        T num = 0;
        while (isdigit(chr)) {
            num = num * 10 + chr - '0';
            chr = getChar();
        }
        return sgn * num;
    }

public:
    InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
    ~InParser() { fin.close(); }

    template<class T>
    friend InParser& operator>>(InParser& in, T& num) {
        num = in.getInt<T>();
        return in;
    }
};
class OutParser {
    vector<char> str;
    int ptr;
    ofstream fout;

    void putChar(char chr) {
        if (ptr == int(str.size())) {
            fout.write(str.data(), str.size());
            ptr = 0;
        }
        str[ptr++] = chr;
    }

    template<class T>
    void putInt(T num) {
        if (num < 0) {
            putChar('-');
            num *= -1;
        }
        if (num > 9)
            putInt(num / 10);
        putChar(num % 10 + '0');
    }

public:
    OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
    ~OutParser() { fout.write(str.data(), ptr); fout.close(); }

    template<class T>
    friend OutParser& operator<<(OutParser& out, const T num) {
        out.putInt(num);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char chr) {
        out.putChar(chr);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char* str) {
        for (int i = 0; str[i]; i++)
            out.putChar(str[i]);
        return out;
    }
};
struct nod
{
    int info=(1<<30);
    nod *st,*dr;
};
int minim;
void actualizare(nod *&rad,int val,int st,int dr,int pos)
{
    if(rad==NULL)
    {
        rad=new nod;
        rad->st=NULL;
        rad->dr=NULL;
    }

    if(st==dr)
    {
        rad->info=val;

        return;
    }
    int mij=(st+dr)/2;
    if(pos<=mij)
    {actualizare(rad->st,val,st,mij,pos);}
    else
    {actualizare(rad->dr,val,mij+1,dr,pos);}

    if(rad->st==NULL)
        rad->info=rad->dr->info;
    else    if(rad->dr==NULL)
        rad->info=rad->st->info;
    else
        rad->info=min(rad->st->info,rad->dr->info);
}
void interogare(nod*rad,int st,int dr,int start,int finish)
{

    if(start<=st&&dr<=finish)
    {
        if(minim>rad->info)
            minim=rad->info;
        return ;
    }
    int mij=(st+dr)/2;
    if(start<=mij)
        interogare(rad->st,st,mij,start,finish);
    if(mij<finish)
        interogare(rad->dr,mij+1,dr,start,finish);
}
int main()
{
    InParser fin("rmq.in");
    OutParser fout("rmq.out");
    int n,m,x,y,z;
    fin>>n>>m;

    nod*rad=NULL;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        actualizare(rad,x,1,n,i);
    }


    for(;m;m--)
    {
        fin>>y>>z;

        minim=1<<30;
        interogare(rad,1,n,y,z);
        fout<<minim<<'\n';

    }
    return 0;
}