#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
#define INF 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

const int NRCHAR = 4096;
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;
    }
    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");
ofstream fout("rmq.out");

const int NMAX = 100001, LOGMAX = 18;

int n, q;
int lg[NMAX], rmq[LOGMAX][NMAX];


int main()
{
    fin >> n >> q;
    for(int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for1(i, n)
        fin >> rmq[0][i];

    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);

    for1(nrquey, q)
    {
        int l, r;
        fin >> l >> r;
        int putere = lg[r - l + 1];
        fout << min(rmq[putere][l], rmq[putere][r - (1 << putere) + 1]) << '\n';
    }


    return 0;
}