//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 1e18, mod = 1e9+7, mod2=998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
} else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 1e6+10;
ll n, m, y[N];
struct segtree{
struct Node{
ll lazy, sum;
};
int size = 1;
vector<Node>stree;
void init(){
while(size < N) size <<= 1;
stree.assign(4*size, {0, 0});
}
void push(int x, int lx, int rx){
if(rx - lx == 1){
return;
}
stree[2*x+1].lazy += stree[x].lazy;
stree[2*x+2].lazy += stree[x].lazy;
int m = (lx + rx)/2;
stree[2*x+1].sum += (m - lx)*stree[x].lazy;
stree[2*x+2].sum += (rx - m)*stree[x].lazy;
stree[x].lazy = 0;
}
void upd(int l, int r, ll v, int x, int lx, int rx){
push(x, lx, rx);
if(lx >= r || rx <= l) return ;
if(lx >= l && rx <= r){
stree[x].lazy += v;
stree[x].sum += (rx - lx)*v;
return;
}
int m = (lx + rx)/2;
upd(l, r, v, 2*x+1, lx, m);
upd(l, r, v, 2*x+2, m, rx);
stree[x].sum = (stree[2*x+1].sum + stree[2*x+2].sum);
}
ll qry(int l, int r, int x, int lx, int rx){
push(x, lx, rx);
if(lx >= r || rx <= l){
return 0;
}
if(lx >= l && rx <= r){
return stree[x].sum;
}
int m = (lx + rx)/2;
ll ans_l = qry(l, r, 2*x+1, lx, m);
ll ans_r = qry(l, r, 2*x+2, m, rx);
return (ans_l + ans_r);
}
void upd(int l, int r, ll val){
upd(l, r, val, 0, 0, size);
}
ll qry(int l, int r){
return qry(l, r, 0, 0, size);
}
} st;
void solve(int tc){
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> y[i];
}
st.init();
for(int i = 1; i < n; i++){
st.upd(min(y[i], y[i+1]), max(y[i], y[i+1]) + 1, 1);
if(i != 1) st.upd(y[i], y[i] + 1, -1);
}
while(m--){
int type;
cin >> type;
if(type == 1){
int pos;
ll val;
cin >> pos >> val;
if(pos == 1){
st.upd(min(y[pos], y[pos+1]), max(y[pos], y[pos+1]) + 1, -1);
}else if(pos == n){
st.upd(min(y[pos-1], y[pos]), max(y[pos-1], y[pos]) + 1, -1);
}else{
st.upd(y[pos], y[pos] + 1, 1);
st.upd(min(y[pos], y[pos+1]), max(y[pos], y[pos+1]) + 1, -1);
st.upd(min(y[pos-1], y[pos]), max(y[pos-1], y[pos]) + 1, -1);
}
y[pos] = val;
if(pos == 1){
st.upd(min(y[pos], y[pos+1]), max(y[pos], y[pos+1]) + 1, 1);
}else if(pos == n){
st.upd(min(y[pos-1], y[pos]), max(y[pos-1], y[pos]) + 1, 1);
}else{
st.upd(y[pos], y[pos] + 1, -1);
st.upd(min(y[pos], y[pos+1]), max(y[pos], y[pos+1]) + 1, 1);
st.upd(min(y[pos-1], y[pos]), max(y[pos-1], y[pos]) + 1, 1);
}
}else{
ll h;
cin >> h;
cout << st.qry(h, h + 1) << endl;
}
}
}
void precalc(){
}
int main() {
// SetIO("moocast");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--){
solve(cnt++);
}
return 0;
}
