#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e7+9;
const int N=5005;//2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n,m; cin>>n>>m;
int v[n];
for (int i=0;i<n;i++) cin>>v[i];
while (m--) {
int t; cin>>t;
if (t==1) {
int i,x; cin>>i>>x; i--;
v[i]=x;
}
else {
int h; cin>>h;
int ans=0;
for (int i=0;i+1<n;i++) {
if ((v[i]<h && v[i+1]>h) || (v[i]>h && v[i+1]<h)) ans++;
}
cout<<ans<<endl;
}
}
}
