#include <fstream>
#include <cmath>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100005];
int t[100005][18];
int n, q;

int main()
{
    f>>n>>q;
    for(int i = 1; i<=n; i++)
    {
        f>>v[i];
    }

    int put = 1;
    int m = log2(n)+1;

    for(int j = 1; j<=m; j++)
    {
        if(j == 1)
        {
            for(int i = 1; i<=n-put+1; i++)
            {
                t[i][j] = i;
            }
        }
        else
        {
            for(int i = 1; i<=n-put+1; i++)
            {
                if(v[t[i][j-1]] < v[t[i+(put/2)][j-1]])
                {
                    t[i][j] = t[i][j-1];
                }
                else
                {
                    t[i][j] = t[i+(put/2)][j-1];
                }
            }
        }
        put *= 2;
    }


    int x, y, l, k, p;
    int m1, m2, ans;
    while(q--)
    {
        f>>x>>y;
        l = y - x + 1;
        k = (int)log2(l);

        m1 = v[t[x][k+1]];

        p = l - pow(2, k);

        m2 = v[t[x+p][k+1]];

        ans = min(m1, m2);
        g<<ans<<'\n';
    }
    return 0;
}