#include <bits/stdc++.h>
using namespace std;
long long tavan(long long x, long long y) {
  long long res = 1;
  while (y) {
    res *= y % 2 ? x : 1;
    res %= ((long long)1e9 + 7);
    x *= x;
    x %= ((long long)1e9 + 7);
    y /= 2;
  }
  return res;
}
struct exhibit {
  long long l, r, v, w;
};
long long n, k, q, num, now[((long long)1020)];
long long ans[((long long)31 * 1000)];
exhibit a[((long long)31 * 1000)];
vector<pair<long long, long long> > seg[4 * ((long long)31 * 1000)];
void add(long long v, long long w, long long dp[]) {
  for (int i = k; i >= w; i--) dp[i] = max(dp[i], dp[i - w] + v);
}
void update(long long ql, long long qr, long long v, long long w,
            long long xl = 0, long long xr = num, long long id = 1) {
  if (xr <= ql || qr <= xl) return;
  if (ql <= xl && xr <= qr) {
    seg[id].push_back({v, w});
    return;
  }
  long long mid = (xl + xr) / 2;
  update(ql, qr, v, w, xl, mid, id * 2);
  update(ql, qr, v, w, mid, xr, id * 2 + 1);
}
void build(long long xl = 0, long long xr = num, long long id = 1) {
  long long ex[((long long)1020)];
  for (int i = 0; i <= k; i++) ex[i] = now[i];
  for (auto u : seg[id]) add(u.first, u.second, now);
  if (xl == xr - 1) {
    for (long long i = 1, ex = 1, ex2 = now[1]; i <= k; i++,
                   ex *= ((long long)1e7 + 19), ex %= ((long long)1e9 + 7),
                   ex2 = max(now[i], ex2))
      if (ex2 > 0) ans[xl] += ex2 * ex, ans[xl] %= ((long long)1e9 + 7);
    for (int i = 0; i <= k; i++) now[i] = ex[i];
    return;
  }
  long long mid = (xl + xr) / 2;
  build(xl, mid, id * 2);
  build(mid, xr, id * 2 + 1);
  for (int i = 0; i <= k; i++) now[i] = ex[i];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(now, -63, sizeof now);
  now[0] = 0;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    long long v, w;
    cin >> v >> w;
    a[i].l = 0, a[i].v = v, a[i].w = w;
    a[i].r = -1;
  }
  cin >> q;
  while (q--) {
    long long t, v, w, x;
    cin >> t;
    if (t == 1) {
      cin >> v >> w;
      a[n].l = num, a[n].v = v, a[n].w = w;
      a[n].r = -1;
      n++;
    }
    if (t == 2) cin >> x, x--, a[x].r = num;
    if (t == 3) num++;
  }
  for (int i = 0; i < n; i++) {
    if (a[i].r == -1) a[i].r = num;
    update(a[i].l, a[i].r, a[i].v, a[i].w);
  }
  build();
  for (int i = 0; i < num; i++) cout << ans[i] << "\n";
  return 0;
}
