#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ui unsigned int
#define ld long double
#define pl pair<long long int, long long int>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
#define sz size()
#define all(x) x.begin(), x.end()
using namespace std;
const int maxn = 1e6 + 11;
const int inf = 1e17 + 1;
const int mod = 1e9 + 7;
// const int mod = 998244353;
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1 , 0, -1, 1, -1, 1};
const double eps = 1e-10;
int n, m;
int h[maxn];
int t[maxn];
int sum(int r) {
int cnt = 0;
for(; r >= 1; r = (r & (r + 1)) - 1) {
cnt += t[ r ];
}
return cnt;
}
void update(int pos, int val) {
for (; pos <= maxn; pos |= (pos + 1))
t[ pos ] += val;
}
void solve() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> h[ i ];
}
for(int i = 1; i < n; i++) {
update(min(h[ i ], h[i + 1]), 1);
update(max(h[ i ], h[i + 1]), -1);
}
while(m--) {
int tp;
cin >> tp;
if(tp == 2) {
int x;
cin >> x;
cout << sum(x) << "\n";
}
else {
int pos, val;
cin >> pos >> val;
if(pos < n) {
update(min(h[ pos ], h[pos + 1]), -1);
update(max(h[ pos ], h[pos + 1]), 1);
update(min(val, h[pos + 1]), 1);
update(max(val, h[pos + 1]), -1);
}
if(pos > 1) {
update(min(h[ pos ], h[pos - 1]), -1);
update(max(h[ pos ], h[pos - 1]), 1);
update(min(val, h[pos - 1]), 1);
update(max(val, h[pos - 1]), -1);
}
h[ pos ] = val;
}
}
}
signed main() {
// freopen("sum.in", "r", stdin);
// freopen("sum.out", "w", stdout);
boost;
int tt = 1;
// cin >> tt;
for(int i = 1; i <= tt; i++) {
// cout << "Case " << i << ":\n";
solve();
}
}
