#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

#define min max
#define nmax 100010
int aint[nmax*4],n,m,tip,a,b;

void build (int nod, int st, int dr)
{
    if (st==dr)
    {
        fin>>aint[nod];
        return;
    }
    int left=nod*2, right=nod*2+1, mid=(st+dr)/2;

    build (left,st,mid);
    build (right,mid+1,dr);
    aint[nod] = min (aint[left],aint[right]);
}

void update (int nod, int st, int dr, int pos, int val)
{
    if (st==dr) ///st==dr==pos
    {
        aint[nod]=val;
        return;
    }
    int left=nod*2, right=nod*2+1, mid=(st+dr)/2;

    if (pos<=mid)    update (left,st,mid,pos,val);
    else    update (right,mid+1,dr,pos,val);
    aint[nod] = min (aint[left],aint[right]);
}

int query (int nod, int st, int dr, int x, int y)
{
    if (x<=st && dr<=y)
        return aint[nod];
    int left=nod*2, right=nod*2+1, mid=(st+dr)/2;

    if (y<=mid)  return query (left,st,mid,x,y);
    else    if (x>mid)   return query (right,mid+1,dr,x,y);
    return min (query (left,st,mid,x,y), query (right,mid+1,dr,x,y));
}


int main()
{
    fin>>n>>m;
    build(1,1,n);
    for (int i=1; i<=m; i++)
    {
        fin>>tip>>a>>b;
        if(tip==0)  fout<<query(1,1,n,a,b)<<'\n';
        if(tip==1)  update(1,1,n,a,b);
    }
    fin.close();
    fout.close();
    return 0;
}