#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const long long OO = 0x3f3f3f3f3f3f3f3fLL;
template <typename T>
inline T &Read(T &first) {
  static char c;
  while (1) {
    c = getchar();
    if (c == '-' || (c >= '0' && c <= '9')) break;
  }
  bool flag = c == '-';
  first = flag ? 0 : c - '0';
  while (1) {
    c = getchar();
    if (c < '0' || c > '9') break;
    (first *= 10) += c - '0';
  }
  if (flag) first = -first;
  return first;
}
const int maxn = 15000, maxm = 1000, maxq = 35000, max0 = 16;
const int p = 1e7 + 19, q = 1e9 + 7;
int n, K;
int opr[maxq + 5];
int v[maxn + 5], w[maxn + 5];
int ans[max0 + 1][maxm + 5];
int del[maxn + 5];
bool in[maxn + 5];
inline void add(int *ans, int first) {
  for (int i = K - w[first]; i >= 0; --i)
    chkmax(ans[i + w[first]], ans[i] + v[first]);
}
inline void work(int l, int r, int dep) {
  bool flag = 0;
  for (int i = (l), _end_ = (r); i < _end_; ++i)
    if (opr[i] == -1) {
      flag = 1;
      break;
    }
  if (!flag) {
    for (int i = (l), _end_ = (r); i < _end_; ++i)
      if (!(opr[i] & 1)) in[opr[i] >> 1] = 1;
    return;
  }
  if (r - l <= 1) {
    long long ret = 0, t = 1;
    for (int i = (1), _end_ = (K + 1); i < _end_; ++i) {
      (ret += t * ans[dep][i]) %= q;
      (t *= p) %= q;
    }
    printf("%I64d\n", ret);
    return;
  }
  memcpy(ans[dep + 1], ans[dep], sizeof ans[dep + 1]);
  int mid = (l + r) >> 1;
  for (int i = (mid), _end_ = (r); i < _end_; ++i) {
    if (opr[i] >= 0) {
      if ((opr[i] & 1) && in[opr[i] >> 1]) add(ans[dep + 1], opr[i] >> 1);
    }
  }
  work(l, mid, dep + 1);
  memcpy(ans[dep + 1], ans[dep], sizeof ans[dep + 1]);
  for (int i = (l), _end_ = (mid); i < _end_; ++i) {
    if (opr[i] >= 0) {
      if (!(opr[i] & 1) && del[opr[i] >> 1] >= r)
        add(ans[dep + 1], opr[i] >> 1);
    }
  }
  work(mid, r, dep + 1);
}
int main() {
  srand(time(NULL));
  scanf("%d%d", &n, &K);
  int qn;
  memset(del, oo, sizeof del);
  for (int i = (0), _end_ = (n); i < _end_; ++i)
    scanf("%d%d", v + i, w + i), opr[i] = i << 1;
  scanf("%d", &qn);
  int tmp = qn + n;
  for (int i = (n), _end_ = (qn + n); i < _end_; ++i) {
    int ty;
    scanf("%d", &ty);
    if (ty == 1) {
      scanf("%d%d", v + n, w + n);
      opr[i] = n << 1;
      ++n;
    } else if (ty == 2) {
      scanf("%d", opr + i), --opr[i];
      del[opr[i]] = i;
      (opr[i] <<= 1) |= 1;
    } else
      opr[i] = -1;
  }
  qn = tmp;
  work(0, qn, 0);
  return 0;
}
