#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define double long double
#define endl '\n'
#define sz size
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
int const INF = LONG_LONG_MAX;

int n, m, a[100005];

void solve()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];

    int k=log2(n);
    k++;
    int st[n+5][k], lg[n+5];
    for(int i=1;i<=n;i++)
        st[i][0]=a[i];
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

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

    for(int i=1;i<=m;i++)
    {
        int l, r;
        cin>>l>>r;
        int val=lg[r-l+1];
        cout<<min(st[l][val], st[r-(1<<val)+1][val])<<endl;
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}