#include <fstream>

using namespace std;

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

const int nmax=10e5+5;
long long inf = 10e17;
int n,m,x,cer,a,b;
int segTree[400000];

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 query(int node, int st, int dr,  int a, int b)
{
    if (a <= st && b >= dr)
        return segTree[node];
    int mij = (st + dr) / 2, r1 = inf, r2 = inf;
    if (a <= mij)
        r1 = query(node * 2, st, mij,  a, b);
    if (b >= mij + 1)
        r2 = query(node * 2 + 1, mij + 1, dr,  a, b);
    return min(r1, r2);
}

int main()
{
    cin>>n>>m;
    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;
        if (cer == 2)
            cout<<query(1,1,n,a,b) << "\n";
        else
            Update(1,1,n,a,b);
    }
    return 0;
}