#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T mdINV(T a, T M) {
  return BM(a, M - 2, M);
}
template <class T>
inline T PW(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
template <class T>
T stringtonumber(const string &Text) {
  istringstream ss(Text);
  T result;
  return ss >> result ? result : 0;
}
template <class T>
bool ISLEFT(T a, T b, T c) {
  if (((a.first.first - b.first.first) * (b.second.second - c.second.second) -
       (b.first.first - c.first.first) * (a.second.second - b.second.second)) <
      0.0)
    return 1;
  else
    return 0;
}
long long int bit[200000 + 2][2];
void update(int in, long long int val, int op) {
  while (in <= 200000) {
    bit[in][op] += val;
    in += in & -in;
  }
}
long long int qry(int in, int op) {
  long long int res = 0;
  while (in > 0) {
    res += bit[in][op];
    in -= in & -in;
  }
  return res;
}
int main() {
  long long int n, k, a, b;
  scanf("%lld%lld", &n, &k);
  scanf("%lld%lld", &a, &b);
  long long int q;
  scanf("%lld", &q);
  while (q--) {
    long long int ty;
    scanf("%lld", &ty);
    if (ty == 1) {
      long long int first, second;
      scanf("%lld%lld", &first, &second);
      long long int re = qry(first, 0) - qry(first - 1, 0);
      update(first, -re, 0);
      re += second;
      update(first, min(b, re), 0);
      re = qry(first, 1) - qry(first - 1, 1);
      update(first, -re, 1);
      re += second;
      update(first, min(a, re), 1);
    } else {
      long long int first, second;
      scanf("%lld", &first);
      second = first;
      second += k - 1;
      long long int res = qry(first - 1, 0) + qry(200000, 1) - qry(second, 1);
      printf("%lld\n", res);
    }
  }
  return 0;
}
