#include <fstream>
#include <cmath>
#include <bitset>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int v[100002];
int M[18][100002];
int main()
{
 int n , m;
 cin >> n >> m;
 int i;
 int x , y;
 for(i = 1; i <= n; i ++)
 {
      cin >> v[i];

 }

    for(i = 1; i <= n;i ++)
    {
         M[0][i] = v[i];
    }
    int j;
    for(i = 1; (1<<i) <= n; i ++)
    {
        for(j = 1; j + (1 << i) - 1 <= n; j ++)
        {
            M[i][j] = min(M[i-1][j] , M[i-1][j + ( 1<<(i - 1))]);
        }
    }
    int lungime = 0;
    for(  i = 1; i <= m; i ++)
    {
        cin >> x  >> y;
        lungime = y - x + 1;
        int lun =log2(lungime);
        cout << min(M[lun][x] , M[lun][y - (1<<lun) + 1])<<'\n';

    }

    return 0;
}