#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvii = vector<vii>;
using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using pll = pair<l, l>;
using vll = vector<pll>;
using vvll = vector<vll>;
using d = double;
using vd = vector<d>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using ld = long double;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pbb = pair<bool, bool>;
using vbb = vector<pbb>;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
void setIO(string name = "")
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if (!name.empty())
{
(void)freopen((name + ".in").c_str(), "r", stdin);
(void)freopen((name + ".out").c_str(), "w", stdout);
}
}
const ld pi = 3.14159265358979323846;
const l LINF = 1e18;
const l INF = 1e9;
const l MOD = 1e9 + 7;
// const l MOD = 998244353;
const l MAXN = 1e6 + 5;
struct BIT
{
l n;
vl table;
BIT(l _n = MAXN)
{
n = _n;
table.assign(n + 1, 0);
}
BIT(const vl &a) : BIT(a.size())
{
n = a.size();
for (int i = 0; i < a.size(); ++i)
update(i + 1, a[i]);
}
void update(l i, l delta)
{
while (i <= n)
{
table[i] += delta;
i += (i & -i);
}
}
l sum(l i)
{
l s = 0;
while (i != 0)
{
s += table[i];
i -= (i & -i);
}
return s;
}
l rangeSum(l i, l j)
{
return sum(j) - sum(i - 1);
}
};
void solve()
{
BIT bit(MAXN);
l n, m;
cin >> n >> m;
vl a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a[i];
auto addSegment = [&](l i, l j, l delta)
{
l lo = min(a[i], a[j]), hi = max(a[i], a[j]);
l L = lo + 1, R = hi - 1;
if (L <= R)
bit.update(L, delta), bit.update(R + 1, -delta);
};
for (l i = 1; i < n; ++i)
addSegment(i, i + 1, +1);
for (l _ = 0; _ < m; ++_)
{
l type;
cin >> type;
if (type == 1)
{
l pos, val;
cin >> pos >> val;
// * removing edges (-1)
/*
* pos > 1 => for first edge
* pos < 1 => for last edge
*/
if (pos > 1)
addSegment(pos - 1, pos, -1);
if (pos < n)
addSegment(pos, pos + 1, -1);
a[pos] = val;
// * adding edges (+1)
if (pos > 1)
addSegment(pos - 1, pos, +1);
if (pos < n)
addSegment(pos, pos + 1, +1);
}
else if (type == 2)
{
l H;
cin >> H;
cout << bit.sum(H) << "\n";
}
}
}
int main()
{
setIO("");
#ifndef ONLINE_JUDGE
// setIO("filename");
#endif
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
