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.
import java.io.*;
import java.util.*;

public class E {

    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;

    int k;

    static final int P = 10_000_000 + 19;
    static final int MOD = 1_000_000_000 + 7;

    class Knapsack {

        List<int[]> dps = new ArrayList<>();

        public Knapsack() {
            dps.add(new int[k + 1]);
        }

        void put(int value, int mass) {
//          System.err.println("push " + value + " " + mass);
            int[] next = dps.get(dps.size() - 1).clone();
            for (int i = k; i >= mass; i--) {
                next[i] = Math.max(next[i], next[i - mass] + value);
            }
            dps.add(next);
        }

        void rollback(int time) {
            while (dps.size() > time) {
//              System.err.println("pop");
                dps.remove(dps.size() - 1);
            }
        }

        int getHash() {
            int[] top = dps.get(dps.size() - 1);
            int ret = 0;
            for (int i = k; i >= 1; i--) {
                ret = (int) (((long) ret * P + top[i]) % MOD);
            }
            return ret;
        }
    }

    static class Query {
        boolean item; // false - get
        int value, mass;
        int from, to;

        public Query(boolean item, int value, int mass, int from, int to) {
            this.item = item;
            this.value = value;
            this.mass = mass;
            this.from = from;
            this.to = to;
        }

        @Override
        public String toString() {
            return "Query [item=" + item + ", value=" + value + ", mass="
                    + mass + ", from=" + from + ", to=" + to + "]";
        }
    }

    void go(List<Query> qs, int low, int high, Knapsack sack) {
        List<Query> newQs = new ArrayList<>();
        int time = sack.dps.size();
        for (Query q : qs) {
            if (q.item && q.from <= low && q.to >= high - 1) {
                sack.put(q.value, q.mass);
            } else if (q.from >= high || q.to < low) {

            } else {
                newQs.add(q);
            }
        }
        if (high - low == 1) {
            for (Query q : newQs) {
                if (!q.item && q.from == low) {
                    out.println(sack.getHash());
//                  System.err.println(low + " " + high + " " + q);
                }
            }
        } else {
            int mid = (low + high) >> 1;

            go(newQs, low, mid, sack);
            go(newQs, mid, high, sack);
        }
        sack.rollback(time);
    }

    void solve() throws IOException {
        int n = nextInt();
        k = nextInt();

        int[] vals = new int[n];
        int[] masses = new int[n];
        for (int i = 0; i < n; i++) {
            vals[i] = nextInt();
            masses[i] = nextInt();
        }

        int q = nextInt();
        int[] ids = new int[n + q];
        int[] types = new int[n + q];
        int[] remove = new int[n + q];
        Arrays.fill(remove, n + q);
        for (int i = 0; i < n; i++) {
            ids[i] = i;
            types[i] = 1;
        }
        vals = Arrays.copyOf(vals, n + q);
        masses = Arrays.copyOf(masses, n + q);

        List<Integer> addPos = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            addPos.add(i);
        }

        int addCnt = n;

        for (int i = n; i < n + q; i++) {
            types[i] = nextInt();
            if (types[i] == 1) {
                vals[i] = nextInt();
                masses[i] = nextInt();
                ids[i] = addCnt++;
                addPos.add(i);
            } else if (types[i] == 2) {
                int remId = nextInt() - 1;
                remove[addPos.get(remId)] = i;
            }
        }

        List<Query> qs = new ArrayList<>();

        for (int i = 0; i < n + q; i++) {
            if (types[i] == 1) {
                qs.add(new Query(true, vals[i], masses[i], i, remove[i]));
            } else if (types[i] == 3) {
                qs.add(new Query(false, 0, 0, i, i));
            }
        }

        // System.err.println(qs);
        go(qs, 0, n + q, new Knapsack());
    }

    E() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }

    public static void main(String[] args) throws IOException {
        new E();
    }

    String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }

    String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}