#include <fstream>
#include <vector>
#include <queue>
using namespace std;
using pii = pair<int,int>;
const int nmax = 1e5 + 1;
const int buc = 316;
int n , m , v[nmax] , s[buc+1] , a, b;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
signed main()
{
    cin >> n >> m;
    for(int i = 1 ; i <= n ; ++i)
    {
        cin >> v[i];
        if(s[i/buc] == 0)
        {
            s[i/buc] = v[i];
        }
        else s[i/buc] = min(s[i/buc],v[i]);
    }
    for(int i = 1 ; i <= m ; ++i)
    {
        cin >> a >> b;
        int sa = a/buc;
        int sb = b/buc;
        if(sa == sb)
        {
            int mn = 1e9;
            for(int j = a ; j <= b ; ++j)
            {
                mn = min(mn,v[j]);
            }
            cout << mn << '\n';
        }
        else
        {
            int cs = (sa+1)*buc - 1;
            int cd = sb*buc;
            int mn = 1e9;
            for(int j = sa+1 ; j < sb ; ++j)
            {
                mn = min(mn,s[j]);
            }
            for(int j = a ; j <= cs ; ++j) mn = min(mn,v[j]);
            for(int j = cd ; j <= b ; ++j) mn = min(mn,v[j]);
            cout << mn << '\n';
        }
    }
    return 0;
}