There's a famous museum in the city where Kleofáš lives. In the museum, n exhibits (numbered 1 through n) had been displayed for a long time; the i-th of those exhibits has value vi and mass wi. 

Then, the museum was bought by a large financial group and started to vary the exhibits. At about the same time, Kleofáš... gained interest in the museum, so to say.

You should process q events of three types:

  * type 1 — the museum displays an exhibit with value v and mass w; the exhibit displayed in the i-th event of this type is numbered n + i (see sample explanation for more details)
  * type 2 — the museum removes the exhibit with number x and stores it safely in its vault
  * type 3 — Kleofáš visits the museum and wonders (for no important reason at all, of course): if there was a robbery and exhibits with total mass at most m were stolen, what would their maximum possible total value be?



For each event of type 3, let s(m) be the maximum possible total value of stolen exhibits with total mass  ≤ m.

Formally, let D be the set of numbers of all exhibits that are currently displayed (so initially D = {1, ..., n}). Let P(D) be the set of all subsets of D and let 

<image>

Then, s(m) is defined as 

<image>

Compute s(m) for each <image>. Note that the output follows a special format.

Input

The first line of the input contains two space-separated integers n and k (1 ≤ n ≤ 5000, 1 ≤ k ≤ 1000) — the initial number of exhibits in the museum and the maximum interesting mass of stolen exhibits. 

Then, n lines follow. The i-th of them contains two space-separated positive integers vi and wi (1 ≤ vi ≤ 1 000 000, 1 ≤ wi ≤ 1000) — the value and mass of the i-th exhibit.

The next line contains a single integer q (1 ≤ q ≤ 30 000) — the number of events.

Each of the next q lines contains the description of one event in the following format:

  * 1 v w — an event of type 1, a new exhibit with value v and mass w has been added (1 ≤ v ≤ 1 000 000, 1 ≤ w ≤ 1000)
  * 2 x — an event of type 2, the exhibit with number x has been removed; it's guaranteed that the removed exhibit had been displayed at that time
  * 3 — an event of type 3, Kleofáš visits the museum and asks his question



There will be at most 10 000 events of type 1 and at least one event of type 3.

Output

As the number of values s(m) can get large, output the answers to events of type 3 in a special format.

For each event of type 3, consider the values s(m) computed for the question that Kleofáš asked in this event; print one line containing a single number 

<image>

where p = 107 + 19 and q = 109 + 7.

Print the answers to events of type 3 in the order in which they appear in the input.

Examples

Input

3 10
30 4
60 6
5 1
9
3
1 42 5
1 20 3
3
2 2
2 4
3
1 40 6
3


Output

556674384
168191145
947033915
181541912


Input

3 1000
100 42
100 47
400 15
4
2 2
2 1
2 3
3


Output

0

Note

In the first sample, the numbers of displayed exhibits and values s(1), ..., s(10) for individual events of type 3 are, in order: 

<image> <image> <image> <image>

The values of individual exhibits are v1 = 30, v2 = 60, v3 = 5, v4 = 42, v5 = 20, v6 = 40 and their masses are w1 = 4, w2 = 6, w3 = 1, w4 = 5, w5 = 3, w6 = 6.

In the second sample, the only question is asked after removing all exhibits, so s(m) = 0 for any m.
#include <bits/stdc++.h>
using namespace std;
const int N = 30111;
const int K = 1024;
const int Mod1 = (int)1e7 + 19;
const int Mod2 = (int)1e9 + 7;
const int Inf = 0x3f3f3f3f;
int type[N];
int value[N];
int mass[N];
int st[N], ed[N];
long long dp[K];
void dfs(int left, int right, vector<int> ex, int max_mass) {
  long long tmp[K];
  memcpy(tmp, dp, sizeof(dp));
  vector<int> nxt_ex;
  for (auto &i : ex)
    if (st[i] <= left && ed[i] >= right) {
      for (int j = max_mass; j >= mass[i]; j--)
        dp[j] = max(dp[j], dp[j - mass[i]] + value[i]);
    } else if (!(ed[i] <= left || st[i] >= right))
      nxt_ex.push_back(i);
  int mid = (left + right) >> 1;
  if (left + 1 == right) {
    if (type[left] == 3) {
      long long ans = 0;
      long long cur = 0;
      long long base = 1;
      for (int i = 1; i <= max_mass; i++) {
        cur = max(cur, dp[i]);
        ans += cur % Mod2 * base % Mod2;
        ans %= Mod2;
        base = base * Mod1 % Mod2;
      }
      cout << ans << '\n';
    }
  } else {
    dfs(left, mid, nxt_ex, max_mass);
    dfs(mid, right, nxt_ex, max_mass);
  }
  memcpy(dp, tmp, sizeof(tmp));
}
int main() {
  ios ::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> value[i] >> mass[i];
    st[i] = 0;
    ed[i] = Inf;
  }
  int q;
  cin >> q;
  int cnt = n;
  for (int i = 0; i < q; i++) {
    cin >> type[i];
    if (type[i] == 1) {
      cnt++;
      cin >> value[cnt] >> mass[cnt];
      st[cnt] = i;
      ed[cnt] = Inf;
    } else if (type[i] == 2) {
      int x;
      cin >> x;
      ed[x] = i;
    }
  }
  vector<int> ex;
  for (int i = 1; i <= cnt; i++) ex.push_back(i);
  dfs(0, q, ex, k);
  return 0;
}
