#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],t[N],der[N*4];
void update(int v,int l,int r,int ql,int qr,int x){
if (l > qr || r < ql)ret;
if (ql <= l && r <= qr){
der[v] += x;
ret ;
}
int m = l+r>>1;
update(v<<1,l,m,ql,qr,x);
update((v<<1)+1,m+1,r,ql,qr,x);
}
int get_sum (int v, int l, int r, int pos) {
if (l == r)ret der[v];
int m = l+r>>1;
if (m < pos)
ret der[v]+get_sum((v<<1)+1,m+1,r,pos);
else
ret der[v]+get_sum(v<<1,l,m,pos);
}
main(){
int m,i,j,k,b,n;
scan2(n,m)
for (i=1;i<=n;++i){
scan1(q[i])
if (i!=1)
update(1,1,1000000,min(q[i-1],q[i]),max(q[i-1],q[i]),1);
}
while (m--){
int t,z;
scan2(t,z)
if (t == 1){
if (z != 1)
update(1,1,1000000,min(q[z-1],q[z]),max(q[z-1],q[z]),-1);
if (z != n)
update(1,1,1000000,min(q[z+1],q[z]),max(q[z+1],q[z]),-1);
int x;
scan1(x)
q[z] = x;
if (z != 1)
update(1,1,1000000,min(q[z-1],q[z]),max(q[z-1],q[z]),1);
if (z != n)
update(1,1,1000000,min(q[z+1],q[z]),max(q[z+1],q[z]),1);
}
else
cout <<get_sum(1,1,1000000,z)<<'\n';
}
}