#include<bits/stdc++.h>
using namespace std ;
#define maxn 1000009
#define ll long long
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
#define TIME (1.0*clock()/TIME_PERS_SEC)
#define re exit(0);
const int mod = 1e9+7 ;
const int INF = 1e9 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<pii> vii ;
void add ( int &a , int b )
{
a += b ;
if ( a >= mod ) a -= mod ;
if ( a < 0 ) a += mod ;
}
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ;}
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ;}
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
}
mt19937 rng (time(0)) ;
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
int n , nq ;
int a [maxn] ;
int bit [maxn] ;
void update ( int x , int w )
{
while ( x < maxn ) bit [x] += w , x += (x&-x) ;
}
int get ( int x )
{
int res = 0 ;
while ( x ) res += bit [x] , x -= (x&-x) ;
return res ;
}
void update ( int x , int y , int w )
{
if ( x > y ) swap (x,y) ;
update (x,1*w) ;
update (y+1,-1*w) ;
}
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
// rf () ;
cin >> n >> nq ;
for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ;
for ( int i = 1 ; i < n ; i ++ ) update (a[i],a[i+1],1) ;
while ( nq -- )
{
int op ; cin >> op ;
if ( op == 1 )
{
int pos , val ; cin >> pos >> val ;
if ( pos > 1 ) update (a[pos-1],a[pos],-1) ;
if ( pos < n ) update (a[pos],a[pos+1],-1) ;
a [pos] = val ;
if ( pos > 1 ) update (a[pos-1],a[pos],1) ;
if ( pos < n ) update (a[pos],a[pos+1],1) ;
}
else
{
int x ; cin >> x ; cout << get (x) << "\n" ;
}
}
}
