#include <bits/stdc++.h>
using i64 = long long;
#ifdef DEBUG
#include "/home/ahmetalp/Desktop/Workplace/debug.h"
#else
#define debug(...) void(23)
#endif
struct Fenwick {
int n;
std::vector<int> tree;
Fenwick(int n_) : n(n_), tree(n + 1) {}
void init(int n_) {
n = n_;
tree.assign(n + 1, 0);
}
void modify(int p, int x) {
for (p += 1; p <= n; p += p & -p) {
tree[p] += x;
}
}
int get(int p) {
int res = 0;
for (p += 1; p; p -= p & -p) {
res += tree[p];
}
return res;
}
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, Q;
std::cin >> N >> Q;
std::vector<int> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> A[i];
}
std::vector<int> vals(A.begin(), A.end());
std::vector<std::array<int, 3>> qq(Q);
for (int i = 0; i < Q; ++i) {
std::cin >> qq[i][0];
if (qq[i][0] == 1) {
std::cin >> qq[i][1] >> qq[i][2];
--qq[i][1];
vals.emplace_back(qq[i][2]);
} else {
std::cin >> qq[i][1];
vals.emplace_back(qq[i][1]);
}
}
vals.emplace_back(-1);
int nvals;
std::sort(vals.begin(), vals.end());
vals.resize(nvals = int(std::unique(vals.begin(), vals.end()) - vals.begin()));
for (int i = 0; i < N; ++i) {
A[i] = std::lower_bound(vals.begin(), vals.end(), A[i]) - vals.begin();
}
for (int i = 0; i < Q; ++i) {
if (qq[i][0] == 1) {
qq[i][2] = std::lower_bound(vals.begin(), vals.end(), qq[i][2]) - vals.begin();
} else {
qq[i][1] = std::lower_bound(vals.begin(), vals.end(), qq[i][1]) - vals.begin();
}
}
debug("wtf");
constexpr int B = 500;
Fenwick suf(0);
std::vector<int> save_ans(B + 1);
auto construct = [&](int l, int r) -> void {
vals.clear();
for (int i = l; i < r; ++i) {
if (qq[i][0] == 2) {
vals.emplace_back(qq[i][1]);
}
}
std::sort(vals.begin(), vals.end());
vals.resize(std::unique(vals.begin(), vals.end()) - vals.begin());
std::vector<std::pair<int, int>> piivec;
for (int i = 0; i + 1 < N; ++i) {
piivec.emplace_back(std::min(A[i], A[i + 1]), std::max(A[i], A[i + 1]));
}
std::sort(piivec.begin(), piivec.end());
suf.init(B + 1);
int pivot = 0;
for (int i = 0; i < vals.size(); ++i) {
while (pivot < piivec.size() && piivec[pivot].first <= vals[i]) {
int idxvals = std::upper_bound(vals.begin(), vals.end(), piivec[pivot].second) - vals.begin() - 1;
suf.modify(idxvals, +1);
pivot++;
}
save_ans[i] = pivot - suf.get(i - 1);
}
};
std::vector<std::tuple<int, int, int>> changed;
for (int l = 0; l < Q; l += B) {
int r = std::min(Q, l + B);
changed.clear();
changed.reserve(4 * B);
debug(l, r);
construct(l, r);
debug("???");
for (int i = l; i < r; ++i) {
if (qq[i][0] == 1) {
for (int idx : {qq[i][1] - 1, qq[i][1]}) {
if (0 <= idx && idx + 1 < N) {
changed.emplace_back(std::min(A[idx], A[idx + 1]), std::max(A[idx], A[idx + 1]), -1);
}
}
A[qq[i][1]] = qq[i][2];
for (int idx : {qq[i][1] - 1, qq[i][1]}) {
if (0 <= idx && idx + 1 < N) {
changed.emplace_back(std::min(A[idx], A[idx + 1]), std::max(A[idx], A[idx + 1]), +1);
}
}
} else {
int idxvals = std::lower_bound(vals.begin(), vals.end(), qq[i][1]) - vals.begin();
int ans = save_ans[idxvals];
debug(ans);
for (auto[x, y, d] : changed) {
if (x <= qq[i][1] && qq[i][1] <= y) {
ans += d;
}
}
std::cout << ans << '\n';
}
}
}
return 0;
}
