#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
int n, q, a[1000005], b[1000005];
void upd(int x, int y) {
for (; x <= 1000000; x += (x & -x)) b[x] += y;
}
int get(int x) {
int y = 0;
for (; x > 0; x -= (x & -x)) y += b[x];
return y;
}
int main() {
speed;
precision;
// code
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i > 1) {
upd(min(a[i - 1], a[i]), 1);
upd(max(a[i - 1], a[i]) + 1, -1);
}
}
while (q--) {
int type, x, y;
cin >> type;
if (type == 1) {
cin >> x >> y;
if (x > 1) {
upd(min(a[x - 1], a[x]), -1);
upd(max(a[x - 1], a[x]) + 1, 1);
}
if (x < n) {
upd(min(a[x], a[x + 1]), -1);
upd(max(a[x], a[x + 1]) + 1, 1);
}
a[x] = y;
if (x > 1) {
upd(min(a[x - 1], a[x]), 1);
upd(max(a[x - 1], a[x]) + 1, -1);
}
if (x < n) {
upd(min(a[x], a[x + 1]), 1);
upd(max(a[x], a[x + 1]) + 1, -1);
}
}
if (type == 2) {
cin >> x;
cout << get(x) << " ";
}
}
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
