A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The factory intends to choose a k-day period to do maintenance and construction; it cannot produce any thimbles during this time, but will be restored to its full production of a thimbles per day after the k days are complete.

Initially, no orders are pending. The factory receives updates of the form di, ai, indicating that ai new orders have been placed for the di-th day. Each order requires a single thimble to be produced on precisely the specified day. The factory may opt to fill as many or as few of the orders in a single batch as it likes.

As orders come in, the factory owner would like to know the maximum number of orders he will be able to fill if he starts repairs on a given day pi. Help the owner answer his questions.

Input

The first line contains five integers n, k, a, b, and q (1 ≤ k ≤ n ≤ 200 000, 1 ≤ b < a ≤ 10 000, 1 ≤ q ≤ 200 000) — the number of days, the length of the repair time, the production rates of the factory, and the number of updates, respectively.

The next q lines contain the descriptions of the queries. Each query is of one of the following two forms: 

  * 1 di ai (1 ≤ di ≤ n, 1 ≤ ai ≤ 10 000), representing an update of ai orders on day di, or 
  * 2 pi (1 ≤ pi ≤ n - k + 1), representing a question: at the moment, how many orders could be filled if the factory decided to commence repairs on day pi? 



It's guaranteed that the input will contain at least one query of the second type.

Output

For each query of the second type, print a line containing a single integer — the maximum number of orders that the factory can fill over all n days.

Examples

Input

5 2 2 1 8
1 1 2
1 5 3
1 2 1
2 2
1 4 2
1 3 2
2 1
2 3


Output

3
6
4


Input

5 4 10 1 6
1 1 5
1 5 5
1 3 2
1 5 2
2 1
2 2


Output

7
1

Note

Consider the first sample.

We produce up to 1 thimble a day currently and will produce up to 2 thimbles a day after repairs. Repairs take 2 days.

For the first question, we are able to fill 1 order on day 1, no orders on days 2 and 3 since we are repairing, no orders on day 4 since no thimbles have been ordered for that day, and 2 orders for day 5 since we are limited to our production capacity, for a total of 3 orders filled.

For the third question, we are able to fill 1 order on day 1, 1 order on day 2, and 2 orders on day 5, for a total of 4 orders.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline int checkbit(T n, T i) {
  return ((n >> i) & T(1));
}
inline int bits_count(int v) {
  v = v - ((v >> 1) & 0x55555555);
  v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
  return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
inline int bits_count(long long v) {
  int t = v >> 32;
  int p = (v & ((1LL << 32) - 1));
  return bits_count(t) + bits_count(p);
}
unsigned int reverse_bits(register unsigned int x) {
  x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1));
  x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2));
  x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4));
  x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8));
  return ((x >> 16) | (x << 16));
}
template <typename T>
inline bool isPowerOfTwo(T n) {
  return (n != 0 and ((n & (n - 1)) == 0));
}
inline int binlog(int n) {
  assert(n > 0);
  return 32 - __builtin_clz(n) - 1;
}
inline int binlog(long long n) {
  assert(n > 0);
  return 64 - __builtin_clzll(n) - 1;
}
void bitprint(int n, int w = 32) {
  for (int i = w - 1; i >= 0; i--) {
    cout << checkbit(n, i);
  }
  cout << "\n";
}
void bitprint(long long n, int w = 64) {
  for (long long i = w - 1; i >= 0; i--) {
    cout << checkbit(n, i);
  }
  cout << "\n";
}
template <typename T>
inline T sqr(T x) {
  T x_ = (x);
  return x_ * x_;
}
template <typename T>
inline T qbr(T x) {
  T x_ = (x);
  return ((x_ * x_) * x_);
}
template <typename T>
inline int sign(T x) {
  T x_ = (x);
  return ((x_ > T(0)) - (x_ < T(0)));
}
template <typename T>
inline T mod(T x, T m) {
  T x_ = (x);
  return (((x_) >= 0) ? ((x_) % (m)) : ((((x_) % (m)) + (m)) % (m)));
}
template <typename T>
inline T gcd(T a, T b) {
  while (b) {
    T t = a % b;
    a = b;
    b = t;
  }
  return a;
}
template <typename T>
inline T gcd_ex(T a, T b, T& x, T& y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  T x1, y1;
  T d = gcd_ex(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return d;
}
template <typename T>
inline T lcm(T a, T b) {
  return (a * (b / gcd(a, b)));
}
template <typename A, typename B, typename C>
function<C(A)> combine(function<B(A)> f, function<C(B)> g) {
  return bind(g, bind(f, placeholders::_1));
}
template <typename Collection, typename UnaryOperation>
void foreach (Collection& col, UnaryOperation op) {
  for_each(begin(col), end(col), op);
}
template <typename Collection, typename UnaryOperation>
Collection fmap(Collection& col, UnaryOperation op) {
  transform(begin(col), end(col), col.begin(), op);
  return col;
}
template <typename Collection, typename binop>
Collection zip(Collection& fc, Collection& sc, binop op) {
  transform(begin(fc), end(fc), sc.begin(), fc.begin(), op);
  return fc;
}
template <typename Collection, typename Condition>
bool exists(Collection& col, Condition con) {
  auto exist = find_if(begin(col), end(col), con);
  return exist != col.end();
}
template <typename Collection, typename Predicate>
Collection filterNot(Collection& col, Predicate predicate) {
  auto returnIterator = remove_if(begin(col), end(col), predicate);
  col.erase(returnIterator, end(col));
  return col;
}
void fastIO() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
}
template <class T1, class T2>
istream& operator>>(istream& in, pair<T1, T2>& P) {
  in >> P.first >> P.second;
  return in;
}
template <class T>
istream& operator>>(istream& in, vector<T>& Col) {
  for (auto& el : Col) in >> el;
  return in;
}
template <class T>
inline void getarr(T* arr, int l, int r) {
  for (long long i = l; i < r; i++) cin >> arr[i];
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
  for (auto& row : v) {
    for (auto& el : row) os << el << " ";
    os << "\n";
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& Col) {
  for (auto& el : Col) os << el << " ";
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& Col) {
  for (auto& el : Col) os << el << " ";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& Col) {
  for (auto& el : Col) os << el << " ";
  return os;
}
template <class T>
inline void printarr(T* arr, int l, int r) {
  for (long long i = l; i < r; i++) {
    cout << arr[i] << " ";
  };
  cout << "\n";
}
template <typename First>
void read(First& t) {
  cin >> t;
}
template <typename First, typename... Args>
void read(First& f, Args&... args) {
  cin >> f;
  read(forward<Args&>(args)...);
}
template <typename T>
void print(T&& t) {
  cout << t << "\n";
}
template <typename First, typename... Args>
void print(First&& f, Args&&... args) {
  cout << f << " ";
  print(forward<Args&&>(args)...);
}
template <typename T>
void printLn(T&& t) {
  cout << t << "\n";
}
template <typename First, typename... Args>
void printLn(First&& f, Args&&... args) {
  cout << f << "\n";
  printLn(forward<Args&&>(args)...);
}
template <typename T, size_t N>
struct MakeTensor {
  template <typename... Args>
  static auto tensor(size_t first, Args... sizes)
      -> vector<decltype(MakeTensor<T, N - 1>::tensor(sizes...))> {
    auto inner = MakeTensor<T, N - 1>::tensor(sizes...);
    return vector<decltype(inner)>(first, inner);
  }
};
template <typename T>
struct MakeTensor<T, 1> {
  static vector<T> tensor(size_t size) { return vector<T>(size); }
};
template <typename T, typename... Args>
auto tensor(Args... args)
    -> decltype(MakeTensor<T, sizeof...(Args)>::tensor(args...)) {
  return MakeTensor<T, sizeof...(Args)>::tensor(args...);
}
template <typename T1, typename T2, typename T3>
struct triple {
  T1 a;
  T2 b;
  T3 c;
  triple(){};
  triple(T1 _a, T2 _b, T3 _c) : a(_a), b(_b), c(_c) {}
};
template <typename T1, typename T2, typename T3>
bool operator<(const triple<T1, T2, T3>& t1, const triple<T1, T2, T3>& t2) {
  if (t1.a != t2.a)
    return t1.a < t2.a;
  else if (t1.b != t2.b)
    return t1.b < t2.b;
  else
    return t1.c < t2.c;
}
template <typename T1, typename T2, typename T3>
inline std::ostream& operator<<(std::ostream& os, const triple<T1, T2, T3>& t) {
  return os << "(" << t.a << ", " << t.b << ", " << t.c << ")";
}
const int MAXN = 2e5;
long long ta[4 * MAXN + 1], tb[4 * MAXN + 1];
long long n, k, lo, hi, q;
void upd_a(int pos, long long val, int v = 1, int tl = 0, int tr = n - 1) {
  if (tl == tr) {
    ta[v] = min(ta[v] + val, hi);
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm) {
      upd_a(pos, val, v * 2, tl, tm);
    } else {
      upd_a(pos, val, v * 2 + 1, tm + 1, tr);
    }
    ta[v] = ta[v * 2] + ta[v * 2 + 1];
  }
}
long long get_a(int l, int r, int v = 1, int tl = 0, int tr = n - 1) {
  if (l > r) return 0;
  if (tl == l && tr == r) {
    return ta[v];
  } else {
    int tm = (tl + tr) >> 1;
    return get_a(l, min(tm, r), v * 2, tl, tm) +
           get_a(max(tm + 1, l), r, v * 2 + 1, tm + 1, tr);
  }
}
void upd_b(int pos, long long val, int v = 1, int tl = 0, int tr = n - 1) {
  if (tl == tr) {
    tb[v] = min(tb[v] + val, lo);
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm) {
      upd_b(pos, val, v * 2, tl, tm);
    } else {
      upd_b(pos, val, v * 2 + 1, tm + 1, tr);
    }
    tb[v] = tb[v * 2] + tb[v * 2 + 1];
  }
}
long long get_b(int l, int r, int v = 1, int tl = 0, int tr = n - 1) {
  if (l > r) return 0;
  if (tl == l && tr == r) {
    return tb[v];
  } else {
    int tm = (tl + tr) >> 1;
    return get_b(l, min(tm, r), v * 2, tl, tm) +
           get_b(max(tm + 1, l), r, v * 2 + 1, tm + 1, tr);
  }
}
int main() {
  fastIO();
  scanf("%lld %lld %lld %lld %lld", &n, &k, &hi, &lo, &q);
  while (q--) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      long long day, amount;
      scanf("%lld %lld", &day, &amount);
      day--;
      upd_a(day, amount);
      upd_b(day, amount);
    } else {
      int p;
      scanf("%d", &p);
      p--;
      printf("%lld\n", get_b(0, p - 1) + get_a(p + k, n - 1));
    }
  }
  return 0;
}
