//#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[100005],n,m,dp[10005][1005];
int main(){
    int i,j,x,y;
    fin >> n >> m;
    for(i=1;i<=n;i++)
     fin >> a[i];
     dp[1][1] = a[1];
    for(i = 1; i <= n; i++)
    {
        dp[i][i] = a[i];
        for(j = i+1; j <= n; j++)
          dp[i][j] = min(a[j], dp[i][j-1]);

    }
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        fout << dp[x][y]<<"\n";
    }
     fin.close();
     fout.close();
    return 0;
}