#include <fstream>
using namespace std;
#define NMAX 100000
int x, y, n, data[4 * 100001], m,minim=NMAX;
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;
    }
};
void update(int ind, int st, int dr,int i,int val)
{
    if (st == dr)
    {
        data[ind] = val;
        return;
    }
    int mij = (st + dr) / 2;
    if(i<=mij){
        update(2*ind,st,mij,i,val);
    }
    else{
        update(2*ind+1,mij+1,dr,i,val);
    }
    data[ind] = min(data[2*ind],data[2*ind+1]);
}
void query(int ind, int st, int dr)
{
    if (x <= st && dr <= y)
    {
        minim = min(minim,data[ind]);
        return;
    }

    int mij = (st + dr) / 2;
    if(x<=mij){
        query(2*ind,st,mij);
    }
    if(mij<y){
        query(2*ind+1,mij+1,dr);
    }
}
int main()
{
    InParser cin("rmq.in");
    OutParser cout("rmq.out");
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int k;
        cin>>k;
        update(1,1,n,i,k);
    }
    for (; m; m--)
    {
        minim = NMAX;
        cin >> x >> y;
        query(1, 1, n);
        cout<<minim<<'\n';
    }
    return 0;
}