#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define int long long
using namespace std;

const int mod=666013;
ll i,j,t;
struct matrice{
    ll rows,cols;
    ll arr[105][105];
};
matrice operator*(matrice a,matrice b){
    matrice c;
    c.rows=a.rows;
    c.cols=b.cols;
    for(i=1;i<=c.rows;i++){
        for(j=1;j<=c.cols;j++){
            c.arr[i][j]=0;
        }
    }
    for(i=1;i<=c.rows;i++){
        for(j=1;j<=c.cols;j++){
            for(t=1;t<=a.cols;t++) c.arr[i][j]=(c.arr[i][j]+(a.arr[i][t]*b.arr[t][j])%mod)%mod;
        }
    }
    return c;
}
int n;
ll a[200005];
ll m;
ll rmq[100005][30];
void buildrmq(){
    for(ll k=1;(1<<k)<=n;k++){
        for(i=1;i+(1<<k)-1<=n;i++){
            rmq[i][k]=min(rmq[i][k-1],rmq[i+(1<<(k-1))][k-1]);
            //cout<<i<<" "<<(1<<k)+i-1<<" "<<rmq[i][k]<<"\n";
        }
    }
}
int32_t main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>m;
    for(i=1;i<=n;i++) cin>>a[i];
    for(i=1;i<=n;i++) rmq[i][0]=a[i];
    buildrmq();
    for(i=1;i<=m;i++){
        ll x,y;
        cin>>x>>y;
        ll dist=y-x+1;
        ll los=floor(log(dist));
        //cout<<los<<"\n";
        //cout<<rmq[x][los]<<" "<<rmq[y-(1<<los)+1][los]<<"\n";
        cout<<min(rmq[x][los],rmq[y-(1<<los)+1][los])<<"\n";
    }
}