Young Luka is an art dealer. He has ~N~ clients and sells artistic paintings to each client. Each client can purchase either colored paintings or black and white paintings, but not both. The client denoted with ~i~ wants to purchase at most ~a_i~ colored paintings and at most ~b_i~ black and white paintings.

The client will always purchase at least one painting. Luka has an almost unlimited amount of paintings, so the number of paintings required from the clients is never a problem. Luka doesn't like selling black and white paintings and knows that if less than ~C~ people get colored paintings, it will make him feel sad.

His clients constantly keep changing their requests or, in other words, the number of paintings they want to purchase. Because of this, Luka is often troubled by the question: "How many different purchases are there, so that at least ~C~ clients get at least one colored painting?" Help Luka and save him from his worries.

Input Specification

The first line of input contains two integers ~N~, ~C~ ~(1 \le N \le 100\,000, 1 \le C \le 20)~.

The second line of input contains ~N~ integers ~a_i~ ~(1 \le a_i \le 1\,000\,000\,000)~.

The third line of input contains ~N~ integers ~b_i~ ~(1 \le b_i \le 1\,000\,000\,000)~.

The fourth line of input contains the number of requirement changes ~Q~ ~(1 \le Q \le 100\,000)~.

Each of the following ~Q~ lines contains three integers, the label of the person changing the requirements ~P~ ~(1 \le P \le N)~, the maximal number of colored paintings they want to purchase ~a_P~ ~(1 \le a_P \le 1\,000\,000\,000)~ and the maximal number of black and white paintings they want to purchase ~b_P~ ~(1 \le b_P \le 1\,000\,000\,000)~.

In test cases worth 30% of total points, it will hold that ~N~ and ~Q~ are smaller than ~1000~.

Output Specification

The output must consist of ~Q~ lines where each line contains the number of different purchases modulo ~10\,007~.

Sample Input 1

2 2
1 1
1 1
1
1 1 1

Sample Output 1

1

Explanation for Sample Output 1

After the first client changes his request from ~(1, 1)~ to ~(1, 1)~ - nothing really changes, the number of ways to sell paintings is 1. The one and only way to sell paintings is to sell the first client one colored painting, and the second client should be sold one colored painting as well. Every client is required to get at least one colored painting because ~C=2~, which means that there should be at least 2 clients with colored paintings.

Sample Input 2

2 2
1 2
2 3
2
1 2 2
2 2 2

Sample Output 2

4
4

Sample Input 3

4 2
1 2 3 4
1 2 3 4
1
4 1 1

Sample Output 3

66