#include <bits/stdc++.h>
using namespace std;
const long long p = 1e7 + 19, q = 1e9 + 7;
long long n, m, k, f[1005], pw[1005], pos[35005], pos1[35005], tot;
pair<long long, long long> e[35005];
bool qr[30005];
vector<pair<long long, long long> > g[120005];
long long read() {
  long long f = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    f = f * 10 + ch - '0';
    ch = getchar();
  }
  return f * w;
}
void modify(long long tr, long long stdl, long long stdr, long long l,
            long long r, long long x, long long y) {
  if (l > stdr || r < stdl) return;
  if (l <= stdl && r >= stdr) {
    g[tr].push_back(make_pair(x, y));
    return;
  }
  long long mid = (stdl + stdr) / 2;
  modify(tr * 2, stdl, mid, l, r, x, y),
      modify(tr * 2 + 1, mid + 1, stdr, l, r, x, y);
}
void solve(long long tr, long long l, long long r) {
  long long tmp[1005] = {0};
  for (long long i = 0; i < g[tr].size(); i++)
    for (long long j = k; j >= 0; j--)
      if (j + g[tr][i].first <= k)
        f[j + g[tr][i].first] =
            max(f[j + g[tr][i].first], f[j] + g[tr][i].second);
  if (l == r) {
    if (qr[l]) {
      long long ans = 0;
      for (long long i = 1; i <= k; i++) ans = (ans + f[i] * pw[i - 1] % q) % q;
      printf("%lld\n", ans);
    }
    return;
  }
  long long mid = (l + r) / 2;
  memcpy(tmp, f, sizeof(tmp));
  solve(tr * 2, l, mid);
  memcpy(f, tmp, sizeof(f));
  solve(tr * 2 + 1, mid + 1, r);
}
signed main() {
  n = read(), k = read();
  pw[0] = 1;
  for (long long i = 1; i <= 1000; i++) pw[i] = pw[i - 1] * p % q;
  for (long long i = 1; i <= n; i++)
    e[i].second = read(), e[i].first = read(), pos[++tot] = 1;
  m = read();
  for (long long i = 1; i <= m; i++) {
    long long opt = read();
    if (opt == 1) {
      long long x = read(), y = read();
      e[++tot] = make_pair(y, x), pos[tot] = i;
    } else if (opt == 2) {
      long long x = read();
      pos1[x] = i;
    } else
      qr[i] = 1;
  }
  for (long long i = 1; i <= tot; i++) {
    if (!pos1[i])
      modify(1, 1, m, pos[i], q, e[i].first, e[i].second);
    else
      modify(1, 1, m, pos[i], pos1[i], e[i].first, e[i].second);
  }
  solve(1, 1, m);
  return 0;
}
