#define REP(a,b) for(int a=0; a<(b); ++a)
#define REP2(a,b) for(int a=1; a<=(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define BCK(a,b,c) for(int a=(b)-1; a>=(c); --a)
#define BCK2(a,b,c) for(int a=(b); a>(c); --a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define x first
#define y second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define l(n) (n<<1)
#define r(n) ((n<<1)+1)
#define f(n) (n>>1)
#define lsb(a) (a&-a)

#include<vector>
#include<stack>
#include<queue>
#include<algorithm>

using namespace std;
#ifndef ONLINE_JUDGE
#include<fstream>
ifstream cin("rmq.in");
ofstream cout("rmq.out");
#else
#include<iostream>
#endif

const int NMAX = 100000+69;
const int PMAX = 1015;
const int INF = 1<<31;
const int dx[] = {0, 0, -1, 1}; //1,1,-1,1};
const int dy[] = {-1, 1, 0, 0}; //1,-1,1,-1};

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

int n,m,a,b,k;
int A[NMAX], Log[NMAX], M[20][NMAX];

int main() {
    FAST;
    cin>>n>>m;
    
    REP2(i,n)
        cin>>A[i];
    
    for(int i=2; i<=n; ++i)
       Log[i]=Log[i>>1]+1;
    
    for(int i=1; i<=n; ++i)
        M[0][i]=A[i];
    
    for(int i=1; (1<<i) < n; ++i)
        for(int j=1; j+(1<<i) <= n; ++j)
            M[i][j]=MIN(M[i-1][j], M[i-1][j+(1<<i)]);
    
    REP(i,m)
    {
        cin>>a>>b;
        b=b+1;
        k=Log[a-b];
        cout<<MIN(M[k][a], M[k][b-(1<<k)])<<"\n";
    }
    
    return 0;
}