#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int mod1 = 10000019;
const int mod2 = 1000000007;
const int maxn = 100100;
int q[maxn], rno[maxn];
pair<int, int> val[maxn];
int ed[maxn];
long long dp[30][1010];
int n, k, nq;
int ln;
pair<int, int> temp[30][maxn];
int lt[30];
set<pair<int, int> > s;
void upd(long long dp[1010], int no) {
  for (int i = k - val[no].second; i >= 0; i--)
    dp[i + val[no].second] = max(dp[i + val[no].second], dp[i] + val[no].first);
}
void getans(int l, int r, int deep) {
  if (l == r) {
    if (q[l] == 3) {
      long long ans = 0;
      for (long long j = 1, rs = 1; j <= k; j++, rs = rs * mod1 % mod2)
        add(ans, dp[deep][j] * rs % mod2, mod2);
      printf("%I64d\n", ans);
    }
    return;
  }
  int mid = (l + r) / 2;
  memcpy(dp[deep + 1], dp[deep], sizeof(dp[deep]));
  auto it = s.end();
  lt[deep] = 0;
  if (s.size())
    for (it--;;) {
      if (it->first <= mid) break;
      temp[deep][lt[deep]++] = *it;
      upd(dp[deep + 1], it->second);
      auto rit = it;
      bool flag = it == s.begin();
      it--;
      s.erase(rit);
      if (flag) break;
    }
  getans(l, mid, deep + 1);
  for (int i = 0; i < lt[deep]; i++) {
    s.insert(temp[deep][i]);
  }
  memcpy(dp[deep + 1], dp[deep], sizeof(dp[deep]));
  lt[deep] = 0;
  for (int i = l; i <= mid; i++)
    if (q[i] == 1) {
      if (ed[rno[i]] <= r) {
        s.insert(make_pair(ed[rno[i]], rno[i]));
        temp[deep][lt[deep]++] = make_pair(ed[rno[i]], rno[i]);
      } else
        upd(dp[deep + 1], rno[i]);
    }
  getans(mid + 1, r, deep + 1);
  for (int i = 0; i < lt[deep]; i++) s.erase(temp[deep][i]);
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &val[i].first, &val[i].second);
  }
  scanf("%d", &nq);
  ln = n;
  memset(ed, 0x3f, sizeof(ed));
  for (int i = 0; i < nq; i++) {
    scanf("%d", q + i);
    if (q[i] == 1) {
      scanf("%d%d", &val[ln].first, &val[ln].second);
      rno[i] = ln;
      ln++;
    } else if (q[i] == 2) {
      scanf("%d", rno + i);
      rno[i]--;
      ed[rno[i]] = i;
    }
  }
  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < n; i++) {
    if (ed[i] >= nq)
      upd(dp[0], i);
    else
      s.insert(make_pair(ed[i], i));
  }
  getans(0, nq - 1, 0);
  return 0;
}
