#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-12;
const int N = 33000;
const int M = 1007;
vector<pair<int, int> > ev[N * 4];
void insert(int left, int right, int l, int r, int x, pair<int, int> v) {
  if (l <= left && r >= right) {
    ev[x].push_back(v);
    return;
  }
  int mid = (left + right) >> 1;
  if (l <= mid) {
    insert(left, mid, l, r, x * 2, v);
  }
  if (r > mid) {
    insert(mid + 1, right, l, r, x * 2 + 1, v);
  }
}
int dp[M];
int rec[30][M];
vector<int> query[N];
int k;
const int p = 10000000 + 19;
const int q = 1000000007;
int ans[N];
void go(pair<int, int> x) {
  for (int i = k; i >= x.first; --i) {
    dp[i] = max(dp[i], dp[i - x.first] + x.second);
  }
}
void dfs(int left, int right, int x, int level) {
  for (int i = 0; i < k + 1; i++) rec[level][i] = dp[i];
  for (__typeof(ev[x].begin()) it = ev[x].begin(); it != ev[x].end(); it++) {
    go(*it);
  }
  if (left != right) {
    int mid = (left + right) >> 1;
    dfs(left, mid, x * 2, level + 1);
    dfs(mid + 1, right, x * 2 + 1, level + 1);
  } else {
    for (__typeof(query[left].begin()) it = query[left].begin();
         it != query[left].end(); it++) {
      long long coef = 1;
      int hashes = 0;
      for (int i = 1; i <= k; ++i) {
        hashes = (hashes + dp[i] * coef) % q;
        coef = coef * p % q;
      }
      cout << hashes << endl;
    }
  }
  for (int i = 0; i < k + 1; i++) dp[i] = rec[level][i];
}
int main() {
  int n, q;
  cin >> n >> k;
  vector<pair<int, int> > g(n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &g[i].second, &g[i].first);
  }
  vector<int> when(n);
  fill(when.begin(), when.end(), 0);
  cin >> q;
  for (int i = 0; i < q; i++) {
    int tp;
    scanf("%d", &tp);
    if (tp == 1) {
      int v, w;
      scanf("%d%d", &v, &w);
      when.push_back(i + 1);
      g.push_back(make_pair(w, v));
    } else if (tp == 2) {
      int which;
      scanf("%d", &which);
      --which;
      insert(0, q, when[which], i + 1, 1, g[which]);
      when[which] = -1;
    } else if (tp == 3) {
      query[i + 1].push_back(i);
    }
  }
  for (int i = 0; i < when.size(); i++) {
    if (when[i] != -1) {
      insert(0, q, when[i], q, 1, g[i]);
    }
  }
  dfs(0, q, 1, 0);
  return 0;
}
