/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;
int n, m,a[100005];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
if (max(n, m) <= 1000)
{
while (m--)
{
int t;
cin >> t;
if (t == 1)
{
int p, v;
cin >> p >> v;
p--;
a[p] = v;
}
else
{
int h,ans=0;
cin >> h;
for (int i = 1; i < n; i++)
if ((a[i - 1] < h && a[i] >= h) || (a[i - 1] > h && a[i] <= h))
ans++;
cout << ans << endl;
}
}
return 0;
}
return 0;
}
