//#include <iostream>
#include <fstream>

using namespace std;

ifstream cin("rmq.in");
ofstream cout("rmq.out");


const int N = 1e5, INF = 1e5 + 1;
int n, queries;
int v[N+1], aint[4*N+1];


void build(int node, int l, int r)
{
    if (l == r)
    {
        aint[node] = v[l];
        return;
    }
    int mid = (l + r) / 2;
    build(node*2, l, mid);
    build(node*2+1, mid+1, r);
    aint[node] = min(aint[node*2], aint[node*2+1]);
}

int query(int node, int l, int r, int L, int R)
{
    if (R < l || r < L)
        return INF;
    if (L <= l && r <= R)
        return aint[node];
    int mid = (l + r) / 2;
    return min( query(node*2, l, mid, L, R), query(node*2+1, mid+1, r, L, R) );
}


int main()
{
    cin >> n >> queries;

    for (int i = 1; i <= n; i++)
        cin >> v[i];
    
    build(1, 1, n);

    for (int q = 1; q <= queries; q++)
    {
        int x, y;
        cin >> x >> y;
        if (x > y)
            swap(x, y);
        cout << query(1, 1, n, x, y) << '\n';
    }

    return 0;
}