Baza

Mirko got a summer internship at a large IT company. The company keeps a database of $N$ rows and $M$ columns.

On his first day Mirko received $Q$ queries. Each query is a list of $M$ numbers. Some of the numbers were lost in transit, and every lost position is written as -1. Mirko wants to know how many rows of the database correspond to each query, that is, how many rows hold the same number as the query in every position that is not -1.

For example, if the query is -1 3 2, count the rows whose first column holds any number, whose second column holds 3, and whose third column holds 2.

Help Mirko and answer all of the queries.

The first line contains two integers $N$ ($1 \le N \le 10^3$) and $M$ ($1 \le M \le 10^3$), the size of the database.

Each of the next $N$ lines contains $M$ integers $A_{ij}$ ($1 \le A_{ij} \le 10^6$), the content of the database.

The next line contains $Q$ ($1 \le Q \le 50$), the number of queries.

Each of the next $Q$ lines contains $M$ integers $B_{ij}$ ($B_{ij} = -1$ or $1 \le B_{ij} \le 10^6$), the description of the $i$th query.

Print $Q$ lines. The $i$th line holds the answer to the $i$th query.

The database in the first example has four rows. The first query asks how many rows have the number 2 in the third column. Rows 1 (1 5 2) and 3 (4 3 2) qualify, so the answer is 2. The second query asks for rows with 3 in the second column and 2 in the third column. Only row 3 (4 3 2) qualifies, so the answer is 1. The third query is all -1, so it asks for the total number of rows, which is 4.