#include <bits/stdc++.h>
using namespace std;
const unsigned _mod = 998244353;
const unsigned mod = 1e9 + 7;
const long long infi = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
long long ksm(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % mod;
    y >>= 1ll;
    x = x * x % mod;
  }
  return ret;
}
long long qpow(long long x, long long y, long long m) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % m;
    y >>= 1ll;
    x = x * x % m;
  }
  return ret;
}
long long _gcd(long long x, long long y) { return y ? _gcd(y, x % y) : x; }
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long a[100010], n, m, l, ans, x, p, d;
int main() {
  cin >> n >> m >> l;
  for (register int i = 1; i <= n; ++i) {
    a[i] = read();
    if (a[i] > l) ans += (a[i - 1] <= l);
  }
  for (register int i = 1; i <= m; ++i) {
    x = read();
    if (!x)
      cout << ans << '\n';
    else {
      p = read(), d = read();
      if (a[p] <= l && a[p] + d > l)
        ans += (1 - (a[p - 1] > l) - (a[p + 1] > l));
      a[p] += d;
    }
  }
  return 0;
}
