#include <bits/stdc++.h>
using namespace std;
long long num[100010];
int main() {
  int n, q, req;
  while (~scanf("%d%d%d", &n, &q, &req)) {
    bool res[100010];
    res[0] = true;
    res[n + 1] = true;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &num[i]);
      if (num[i] <= req)
        res[i] = true;
      else
        res[i] = false;
    }
    int qiu = 0;
    bool flag = true;
    for (int i = 1; i <= n; i++) {
      if (flag == true && res[i] == false) {
        qiu++;
        flag = false;
      }
      if (res[i] == true) flag = true;
    }
    for (int i = 0; i < q; i++) {
      int cur;
      scanf("%d", &cur);
      if (cur == 0) {
        cout << qiu << endl;
      } else {
        int a;
        long long b;
        scanf("%d%lld", &a, &b);
        num[a] += b;
        if (res[a] == true && num[a] > req) {
          res[a] = false;
          if (res[a - 1] == false && res[a + 1] == false) qiu--;
          if (res[a - 1] == true && res[a + 1] == true) qiu++;
        }
      }
    }
  }
}
