#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#define ll long long
#define ull unsigned long long
#define ld long double
#define chad char
#define mod 1'000'000'007
#define dim 100005
#define lim 1000000
#define BASE 31
#define NMAX 21'005
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace __gnu_pbds; 
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int t=1;
int n;
int q;
int rmq[30][dim];
int lg[dim];

void pre()
{
    lg[1]=0;
    for(int i=2; i<=n; i++)
        lg[i]=1+lg[i/2];

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

int query(int st,int dr)
{
    int l=lg[dr-st+1];
    return min(rmq[l][st],rmq[l][dr-(1<<l)+1]);
}

void solve()
{
    fin >> n >> q;
    for(int i=1; i<=n; i++)
        fin >> rmq[0][i];   
    
    pre();
    while(q--)
    {
        int st,dr;
        fin >> st >> dr;
        if(st>dr)
            swap(st,dr);

        fout << query(st,dr) << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    //cin >> t;
    while(t--)
        solve();

    return 0;
}