#include <iostream>

using namespace std;

int main()


{ int n, cnt = 0,i,nr,j,h ;
cin >> n ;




    {
    cin >> h[i];

}
int cnt = 0, o,r ,s ;

for (i = 1, i <= n, j++)
{
    o = r = 0;
    for (j=1, j < n , j++)


        if (h[j]< h [i])
            o++;
        for (j=i+1, j<i, j++)
        if (h[j] < h[i])
            r++;
        if (min (l,r)*s < max (l,r))
        cnt++;

        int bit[100002], v[100002], m;
void update(int i, int val)
{
    while(i <= m)
    {
        bit[i] += val;
        i += i & -i;
    }
}
int prefixSum(int i)
{
    int sum = 0;
    while(i > 0)
    {
        sum += bit[i];
        i -= i & -i;
    }
    return sum;
}
int rangeSum(int i, int j)
{
    return prefixSum(j) - prefixSum(i - 1);
}
int main()
{
    int n, a, b, ok, k, x;
    cin >> n >> m >> k >> x;
    for(int i = 1; i <= n; i++)
    {
        cin >> v[i];
        update(v[i], 1);
    }
    for(int i = 1; i <= k; i++)
    {
        cin >> ok >> a >> b;
        if(ok == 0)
        {
            update(v[a], -1);
            update(b, 1);
            v[a] = b;
        }
        else if(ok == 1)
        {
            int sum = rangeSum(a, b);
            if(sum > x)
                cout << sum << '\n';
        }
    }









}



   cout << cnt;


    return 0;
}