#include <bits/stdc++.h>
using namespace std;
long long int start[100001], finish[100001], val[100001], wt[100001],
    store[100001], dp[100001], k, n, p = 10000019, prefix[100001], mark[100001],
                                     res[100001];
vector<pair<long long int, long long int> > tree[4 * 100001];
inline long long int add1(long long int x, long long int y) {
  return (x + y) % 1000000007;
}
inline long long int mul1(long long int x, long long int y) {
  return (x * y) % 1000000007;
}
void add(long long int node, long long int a, long long int b, long long int l,
         long long int r, long long int ind) {
  if (a > b || a > r || b < l) return;
  if (a >= l && b <= r) {
    tree[node].push_back({val[ind], wt[ind]});
    return;
  }
  long long int mid = (a + b) / 2;
  add(2 * node, a, mid, l, r, ind);
  add(2 * node + 1, mid + 1, b, l, r, ind);
}
void solve(long long int node, long long int a, long long int b) {
  if (a > b) return;
  long long int store[1001] = {0};
  for (long long int i = 0; i <= k; i++) store[i] = dp[i];
  for (auto it : tree[node]) {
    long long int value = it.first;
    long long int weight = it.second;
    for (long long int i = k; i >= 0; i--) {
      if (i + weight <= k) dp[i + weight] = max(dp[i + weight], dp[i] + value);
    }
  }
  prefix[0] = 0;
  for (long long int i = 1; i <= k; i++) prefix[i] = max(prefix[i - 1], dp[i]);
  if (a == b) {
    if (!mark[a]) {
      for (long long int i = 0; i <= k; i++) dp[i] = store[i];
      return;
    }
    long long int ans = 0;
    long long int temp = 1;
    for (long long int i = 1; i <= k; i++) {
      ans = add1(ans, mul1(prefix[i], temp));
      temp = mul1(temp, p);
    }
    res[a] = ans;
    for (long long int i = 0; i <= k; i++) dp[i] = store[i];
    return;
  }
  long long int mid = (a + b) / 2;
  solve(2 * node, a, mid);
  solve(2 * node + 1, mid + 1, b);
  for (long long int i = 0; i <= k; i++) dp[i] = store[i];
  return;
}
int main() {
  ios::sync_with_stdio(false);
  ;
  cin.tie(0);
  ;
  long long int ctr, q, type, x, y, i;
  cin >> n >> k;
  for (i = 1; i <= n; i++) {
    cin >> val[i] >> wt[i];
    start[i] = 1;
  }
  ctr = n;
  cin >> q;
  for (i = 1; i <= q; i++) {
    cin >> type;
    if (type == 1) {
      ctr++;
      cin >> val[ctr] >> wt[ctr];
      start[ctr] = i;
    } else if (type == 2) {
      cin >> x;
      finish[x] = i;
    } else
      mark[i] = 1;
  }
  for (i = 1; i <= ctr; i++) {
    if (!finish[i]) finish[i] = q;
  }
  for (i = 1; i <= ctr; i++) add(1, 1, q, start[i], finish[i], i);
  solve(1, 1, q);
  for (i = 1; i <= q; i++) {
    if (mark[i]) cout << res[i] << " ";
  }
  return 0;
}
