#include<bits/stdc++.h> using namespace std; const int MaxN = 8005; int n, q, a[MaxN], b[MaxN], num, x, v, ans; int main() { //freopen("sort.in", "r",stdin); //freopen("sort.out","w",stdout); cin >> n >> q; for(int i = 1;i <= n; i++) cin >> a[i]; for(int i = 1; i <= n; i++) { for(int j = 1;j <= i; j++) { if(i == j || a[j] < a[i] || a[j] == a[i]) b[i]++; else b[j]++; } } for(int i = 0;i < q; i++) { cin >> num; if(num == 1) { cin >> x >> v; for(int i = 1;i <= n; i++) { if(i == x) continue; if((a[i] < a[x] || a[i] == a[x] && i < x) && (a[i] > v || a[i] == v && i > x)) { b[i]++; b[x]--; } else if((a[i] > a[x] || a[i] == a[x] && i > x) && (a[i] < v || a[i] == v && i < x)) { b[i]--; b[x]++; } } a[x] = v; } if(num == 2) { cin >> x; cout << b[x] << endl; } } return 0; }