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.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.util.ArrayList;
import java.io.UncheckedIOException;
import java.util.List;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 29);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            EAMuseumRobbery solver = new EAMuseumRobbery();
            solver.solve(1, in, out);
            out.close();
        }
    }

    static class EAMuseumRobbery {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.ri();
            int k = in.ri();
            List<Item> items = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                Item item = new Item(in.ri(), in.ri(), 0);
                items.add(item);
                item.id = items.size();
            }
            int q = in.ri();
            Query[] qs = new Query[q];
            for (int i = 0; i < q; i++) {
                int t = in.ri();
                if (t == 1) {
                    Item item = new Item(in.ri(), in.ri(), i);
                    items.add(item);
                    item.id = items.size();
                } else if (t == 2) {
                    int num = in.ri() - 1;
                    items.get(num).die = i;
                } else {
                    qs[i] = new Query();
                }
            }

            OfflineUndoSegment seg = new OfflineUndoSegment(0, q - 1);
            UndoKnapsack knapsack = new UndoKnapsack(k + 1);
            for (Item item : items) {
                if (item.die == -1) {
                    item.die = q;
                }
                seg.update(item.born, item.die - 1, 0, q - 1, knapsack.add(item.w, item.v));
            }
            long[] dp = new long[k + 1];
            seg.solve(0, q - 1, i -> {
                if (qs[i] == null) {
                    return;
                }
                System.arraycopy(knapsack.dp, 0, dp, 0, k + 1);
                for (int j = 1; j <= k; j++) {
                    dp[j] = Math.max(dp[j - 1], dp[j]);
                }
                long a = (int) 1e7 + 19;
                long b = (int) 1e9 + 7;
                long sum = 0;
                for (int j = k; j >= 1; j--) {
                    sum = (sum * a + dp[j]) % b;
                }
                qs[i].ans = (int) sum;
            });
            for (Query query : qs) {
                if (query == null) {
                    continue;
                }
                out.println(query.ans);
            }
        }

    }

    static class DigitUtils {
        private DigitUtils() {
        }

        public static int floorAverage(int x, int y) {
            return (x & y) + ((x ^ y) >> 1);
        }

    }

    static class FastInput {
        private final InputStream is;
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int ri() {
            return readInt();
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }

    static class Item {
        int id;
        int v;
        int w;
        int born;
        int die = -1;

        public Item(int v, int w, int born) {
            this.v = v;
            this.w = w;
            this.born = born;
        }

    }

    static class FastOutput implements AutoCloseable, Closeable, Appendable {
        private static final int THRESHOLD = 1 << 13;
        private final Writer os;
        private StringBuilder cache = new StringBuilder(THRESHOLD * 2);

        public FastOutput append(CharSequence csq) {
            cache.append(csq);
            return this;
        }

        public FastOutput append(CharSequence csq, int start, int end) {
            cache.append(csq, start, end);
            return this;
        }

        private void afterWrite() {
            if (cache.length() < THRESHOLD) {
                return;
            }
            flush();
        }

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput append(char c) {
            cache.append(c);
            afterWrite();
            return this;
        }

        public FastOutput append(int c) {
            cache.append(c);
            afterWrite();
            return this;
        }

        public FastOutput append(String c) {
            cache.append(c);
            afterWrite();
            return this;
        }

        public FastOutput println(int c) {
            return append(c).println();
        }

        public FastOutput println() {
            return append(System.lineSeparator());
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static abstract class CommutativeUndoOperation implements UndoOperation {
    }

    static class Query {
        int ans;

    }

    static class UndoKnapsack {
        public long[] dp;
        public static final long INF = (long) 2e18;

        public UndoKnapsack(int size) {
            dp = new long[size + 1];
            Arrays.fill(dp, -INF);
            dp[0] = 0;
        }

        public CommutativeUndoOperation add(int weight, long value) {
            return new CommutativeUndoOperation() {
                long[] next = new long[dp.length];


                public void apply() {
                    for (int i = 0; i < dp.length; i++) {
                        next[i] = dp[i];
                        if (i >= weight) {
                            next[i] = Math.max(next[i], dp[i - weight] + value);
                        }
                    }

                    swap();
                }

                void swap() {
                    long[] tmp = dp;
                    dp = next;
                    next = tmp;
                }


                public void undo() {
                    swap();
                }
            };
        }

    }

    static class OfflineUndoSegment {
        private OfflineUndoSegment left;
        private OfflineUndoSegment right;
        private List<CommutativeUndoOperation> items = new ArrayList<>();

        private void modify(CommutativeUndoOperation item) {
            items.add(item);
        }

        public void pushUp() {
        }

        public void pushDown() {
        }

        public OfflineUndoSegment(int l, int r) {
            if (l < r) {
                int m = DigitUtils.floorAverage(l, r);
                left = new OfflineUndoSegment(l, m);
                right = new OfflineUndoSegment(m + 1, r);
                pushUp();
            } else {

            }
        }

        private boolean enter(int ll, int rr, int l, int r) {
            return ll <= l && rr >= r;
        }

        private boolean leave(int ll, int rr, int l, int r) {
            return ll > r || rr < l;
        }

        public void update(int ll, int rr, int l, int r, CommutativeUndoOperation item) {
            if (leave(ll, rr, l, r)) {
                return;
            }
            if (enter(ll, rr, l, r)) {
                modify(item);
                return;
            }
            pushDown();
            int m = DigitUtils.floorAverage(l, r);
            left.update(ll, rr, l, m, item);
            right.update(ll, rr, m + 1, r, item);
            pushUp();
        }

        public void solve(int l, int r, OfflineUndoSegment.Callback consumer) {
            for (CommutativeUndoOperation item : items) {
                item.apply();
            }
            if (l < r) {
                int mid = DigitUtils.floorAverage(l, r);
                left.solve(l, mid, consumer);
                right.solve(mid + 1, r, consumer);
            } else {
                consumer.accept(l);
            }

            Collections.reverse(items);
            for (CommutativeUndoOperation item : items) {
                item.undo();
            }
        }

        public interface Callback {
            void accept(int index);

        }

    }

    static interface UndoOperation {
        void apply();

        void undo();

    }
}

