#include<cstdio>
#include<cctype>
#define MAX_N 100000
#define buf_SIZE 1 << 19
#define MAX_LOG 17
using namespace std;

int v[MAX_N], sparse[MAX_N][MAX_LOG], n, m;
int pos = buf_SIZE;
char buf[buf_SIZE];

inline int log2(int x)
{
    return 31 - __builtin_clz(x);
}

inline char getChar(FILE *fin)
{
    if(pos == buf_SIZE)
    {
        fread(buf,1,buf_SIZE,fin);
        pos = 0;
    }
    return buf[pos++];
}

inline int read(FILE *fin)
{
    int res = 0;
    char ch;
    do
    {
        ch = getChar(fin);
    }while(!isdigit(ch));
    do
    {
        res = 10*res + ch - '0';
        ch = getChar(fin);
    }while(isdigit(ch));
    return res;
}

inline int RMQ(int low, int high)
{
    int l, k;
    l = high - low + 1;
    k = log2(l);
    if(v[sparse[low][k]] <= v[sparse[low + l - (1 << k)][k]])
        return v[sparse[low][k]];
    else return v[sparse[low + l - (1 << k)][k]];
}

int main()
{
    int i, x, y, j;
    FILE *fin, *fout;
    fin = fopen("rmq.in","r");
    fout = fopen("rmq.out","w");
    n = read(fin); m = read(fin);
    for(i=0; i<n; i++)
        v[i] = read(fin);
    for(i=0; i<n; i++)
        sparse[i][0] = i;
    for(j=1; (1 << j) <= n; j++)
        for(i=0; i + (1 << j) - 1 < n; i++)
            if(v[sparse[i][j-1]] < v[sparse[i + (1 << (j-1))][j-1]])
                sparse[i][j] = sparse[i][j-1];
            else sparse[i][j] = sparse[i + (1 << (j-1))][j-1];
    for(i=0; i<m; i++)
    {
        x = read(fin); y = read(fin);
        fprintf(fout,"%d\n",RMQ(x-1,y-1));
    }
    fclose(fin);
    fclose(fout);
    return 0;
}