#include <fstream>

using namespace std;

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

const int nmax=10e5+5;
const int INF=10E8-1;
int n,m,x,cer,a,b;
int segTree[4*nmax];

void Update(int node, int l, int r, int pos, int val)
{
    if (l == r)
    {
        segTree[node] = val;
        return;
    }

    int mid = (l + r) / 2;
    if (pos <= mid)
        Update(2 * node, l, mid, pos, val);
    else
        Update(2 * node + 1, mid + 1, r, pos, val);
    segTree[node] = min(segTree[2 * node], segTree[2 * node + 1]);
}

int RMQ(int pos, int lo, int hi, int qlow, int qhigh)
{
    if (lo == qlow && hi == qhigh)
        return segTree[pos];
    int mid = (lo + hi) / 2;
    if (qhigh<=mid)
        return RMQ(2 * pos, lo, mid, qlow, qhigh);
    if (qlow>mid)
        return RMQ(2*pos+1,mid+1,hi,qlow,qhigh);
    return min(RMQ(2*pos,lo,mid,qlow,mid),RMQ(2*pos+1,mid+1,hi,mid+1,qhigh));
}

int main()
{
    cin>>n>>m;
    for(int i=0;i<=4*n;i++)
        segTree[n]=INF;
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        Update(1,1,n,i,x);
    }
    for (int i=1; i<= m; i++)
    {
        cin>>cer>>a>>b;

        cout<<RMQ(1,1,n,a,b) <<endl;
    }
    return 0;
}