#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
const int MAXVAL = 8e5;
const int INF = 2147483647;
struct Data { int t, a, b; };
int N, Q, A[MAXN+10];
Data B[MAXN+10];
int tree[4*MAXVAL+10];
vector<int> comp, comp2;
int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin()+1; }
int getcomp2(int x) { return *lower_bound(comp2.begin(), comp2.end(), x); }
void update(int node, int tl, int tr, int l, int r, int val)
{
if(l>r) return;
if(tr<l || r<tl) return;
if(l<=tl && tr<=r)
{
tree[node]+=val;
return;
}
int mid=tl+tr>>1;
update(node*2, tl, mid, l, r, val);
update(node*2+1, mid+1, tr, l, r, val);
}
int query(int node, int tl, int tr, int pos)
{
if(tl==tr) return tree[node];
int mid=tl+tr>>1;
if(pos<=mid) return tree[node]+query(node*2, tl, mid, pos);
else return tree[node]+query(node*2+1, mid+1, tr, pos);
}
int main()
{
int i, j;
scanf("%d%d", &N, &Q);
for(i=1; i<=N; i++) scanf("%d", &A[i]), comp.push_back(A[i]), comp.push_back(A[i]+1), comp2.push_back(A[i]);
for(i=1; i<=Q; i++)
{
scanf("%d", &B[i].t);
if(B[i].t==1) scanf("%d", &B[i].a);
else scanf("%d%d", &B[i].a, &B[i].b), comp.push_back(B[i].b), comp.push_back(B[i].b+1), comp2.push_back(B[i].b);
}
comp.push_back(INF); comp.push_back(1); comp2.push_back(INF); comp2.push_back(0);
sort(comp.begin(), comp.end()); sort(comp2.begin(), comp2.end());
comp.erase(unique(comp.begin(), comp.end()), comp.end()); comp2.erase(unique(comp2.begin(), comp2.end()), comp2.end());
for(i=1; i<=N+1; i++)
{
int a=min(A[i], A[i-1])+1, b=max(A[i], A[i-1]);
update(1, 1, comp.size(), getcomp(a), getcomp(b), 1);
}
for(i=1; i<=Q; i++)
{
if(B[i].t==1) printf("%d\n", query(1, 1, comp.size(), getcomp(getcomp2(B[i].a)))/2);
else
{
int a, b;
a=min(A[B[i].a], A[B[i].a-1])+1, b=max(A[B[i].a], A[B[i].a-1]);
update(1, 1, comp.size(), getcomp(a), getcomp(b), -1);
a=min(A[B[i].a], A[B[i].a+1])+1, b=max(A[B[i].a], A[B[i].a+1]);
update(1, 1, comp.size(), getcomp(a), getcomp(b), -1);
A[B[i].a]=B[i].b;
a=min(A[B[i].a], A[B[i].a-1])+1, b=max(A[B[i].a], A[B[i].a-1]);
update(1, 1, comp.size(), getcomp(a), getcomp(b), 1);
a=min(A[B[i].a], A[B[i].a+1])+1, b=max(A[B[i].a], A[B[i].a+1]);
update(1, 1, comp.size(), getcomp(a), getcomp(b), 1);
}
}
}
