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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author AlexFetisov
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE_MuseumRobbery solver = new TaskE_MuseumRobbery();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE_MuseumRobbery {
        int K;
        int[] res;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            K = in.nextInt();
            List<Segment> segments = new ArrayList<Segment>();
            for (int i = 0; i < n; ++i) {
                segments.add(new Segment(in.nextInt(), in.nextInt(), 0));
            }
            int Q = in.nextInt();
            List<Integer> robs = new ArrayList<Integer>();
            for (int i = 0; i < Q; ++i) {
                int type = in.nextInt();
                if (type == 1) {
                    segments.add(new Segment(in.nextInt(), in.nextInt(), i));
                } else if (type == 2) {
                    segments.get(in.nextInt() - 1).right = i;
                } else {
                    robs.add(i);
                }
            }
            res = new int[Q];
            rec(0, Q, new int[K + 1], segments);
            for (int i : robs) {
                out.println(res[i]);
            }
        }

        private void rec(int left, int right, int[] a, List<Segment> segments) {
            List<Segment> newSegments = new ArrayList<Segment>();
            for (Segment e : segments) {
                if (e.left <= left && e.right >= right) {
                    e.update(a);
                } else if (right >= e.left && e.right > left) {
                    newSegments.add(e);
                }
            }
            if (left + 1 == right) {
//            System.err.println(left + " " + ArrayUtils.toString(a));
                res[left] = getHash(a);
                return;
            }
            int middle = (left + right) / 2;
            rec(left, middle, a.clone(), newSegments);
            rec(middle, right, a.clone(), newSegments);
        }

        int getHash(int[] a) {
            int res = 0;
            long p = (long) 1e7 + 19;
            int MOD = (int) 1e9 + 7;
            long P = 1;
            for (int i = 1; i <= K; ++i) {
                res += (a[i] * P) % MOD;
                if (res >= MOD) {
                    res -= MOD;
                }
                P *= p;
                P %= MOD;
            }
            return res;
        }

        class Segment {
            int left;
            int right = Integer.MAX_VALUE;
            int w;
            int value;

            public void update(int[] a) {
                for (int i = K; i >= w; --i) {
                    a[i] = Math.max(a[i], a[i - w] + value);
                }
            }

            public Segment(int value, int w, int left) {
                this.left = left;
                this.w = w;
                this.value = value;
            }

        }

    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer stt;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
        }

        public String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                return null;
            }
        }

        public String nextString() {
            while (stt == null || !stt.hasMoreTokens()) {
                stt = new StringTokenizer(nextLine());
            }
            return stt.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

    }
}

