#include <bits/stdc++.h>
using namespace std;
const int p = 1e7 + 19, mo = 1e9 + 7;
int n, k, T, cnt, tot, opt, x, v[30010 + 5000], w[30010 + 5000],
    lef[30010 + 5000], rig[30010 + 5000];
vector<int> wh[30010 * 4];
int f[1010];
void add(int o, int l, int r, int x, int L, int R) {
  if (r < L || R < l) return;
  if (L <= l && r <= R) return wh[o].push_back(x);
  int mid((l + r) >> 1);
  add(o << 1, l, mid, x, L, R);
  add(o << 1 | 1, mid + 1, r, x, L, R);
}
void copy(int *g, int *f) {
  for (int i = 1; i <= k; i++) g[i] = f[i];
}
void upd(int *f, int o) {
  for (int i = 0, s = wh[o].size(), x; i < s; i++) {
    x = wh[o][i];
    for (int j = k; j >= w[x]; j--)
      f[j] = ((f[j - w[x]] + v[x]) > (f[j]) ? f[j - w[x]] + v[x] : f[j]);
  }
}
void print(int *f) {
  int ans(0), s(1), t(0);
  for (int i = 1; i <= k; i++) {
    ans += 1LL * s * (t = ((f[i]) > (t) ? f[i] : t)) % mo, s = 1LL * s * p % mo;
    if (ans >= mo) ans -= mo;
  }
  printf("%d\n", ans);
}
void work(int o, int l, int r, int *f) {
  int nt[1010];
  copy(nt, f), upd(nt, o);
  if (l < r) {
    int mid((l + r) >> 1);
    work(o << 1, l, mid, nt);
    work(o << 1 | 1, mid + 1, r, nt);
  } else
    print(nt);
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", v + i, w + i), lef[i] = cnt + 1;
  scanf("%d", &T);
  memset(rig, -1, sizeof(rig));
  for (int i = 1; i <= T; i++) {
    scanf("%d", &opt);
    if (opt == 1) {
      tot++;
      scanf("%d %d", v + n + tot, w + n + tot);
      lef[n + tot] = cnt + 1;
    }
    if (opt == 2) {
      scanf("%d", &x);
      rig[x] = cnt;
    }
    if (opt == 3) cnt++;
  }
  for (int i = 1; i <= n + tot; i++)
    if (lef[i]) add(1, 1, cnt, i, lef[i], rig[i] > -1 ? rig[i] : cnt);
  work(1, 1, cnt, f);
  return 0;
}
