#include <fstream>
using namespace std;
int v[100005], sp[100005][20], lg[100005];
void bst(int arr[], int n)
{
    for(int i=0; i<n; i++)
        sp[i][0]=arr[i];

    int k = lg[n];
    for (int j = 1; j <= k; j++)
    {
        for (int i = 0; i + (1<<j)-1 < n; i++)
        {
            sp[i][j] = min(sp[i][j - 1], sp[i + (1<<(j-1)) ][j-1]);
        }
    }
}
int func(int i, int j)
{
    int len = j-i+1;
    int k = lg[j - i + 1];

    return min(sp[i][k], sp[i+len-(1<<k)][k]);
}
int main()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n, m, x, y;
    cin>>n>>m;
    for(int i=2; i<=n; i++)
        lg[i] = 1 + lg[i/2];
    for(int i=0; i<n; i++)
    {
        cin>>v[i];
    }
    bst(v, n);
    int k=lg[n];
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        cout<<func(x-1, y-1)<<'\n';
    }
    return 0;
}