Folder Cleanup (small)

The main folder contains various files and folders.

main
 ├─ FolderA
 │    ├─ File1
 │    └─ File2
 └─ FolderB
       ├─ FolderC
       ├─ File1
       └─ File3

The structure above shows the hierarchy under the main folder. FolderA, FolderB, and FolderC are folders, and File1, File2, and File3 are files. Files with the same name are the same file.

A folder cannot contain two or more files with the same name.

A directory under main cannot contain two or more folders with the same name.

To clean up the folders, you want to inspect the files under the main folder.

Write a program that answers queries about folders and files.

The first line gives the total number of folders $N$ and the total number of files $M$ under the main folder, separated by a space.

Lines 2 through $N + M + 1$ each give the name of the parent folder $P$, the name of the folder or file $F$, and a value $C$ indicating whether it is a folder, separated by spaces.

$C$ is 1 if $F$ is a folder and 0 if $F$ is a file.

Line $N + M + 2$ gives the number of queries $Q$.

The next $Q$ lines each contain a query. Each query gives the path of a folder starting from main. For example, if a query is about FolderB inside the main folder, it is given as main/FolderB, the path of FolderB. The path given in a query is guaranteed to contain an existing folder.

For each query, in order, print on one line the number of distinct file names and the total number of files under that folder.

The number of distinct file names counts identical files as one. The total number of files counts each file separately even if there are identical files.

For example, if there are 5 files named File1, the number of distinct file names is 1 and the total number of files is 5.

• $1 \le N \le 1,000$
• $1 \le M \le 1,000$
• $1 \le |P| \le 10$
• $1 \le |F| \le 10$
• $0 \le C \le 1$
• $1 \le Q \le 1,000$
• $P$ and $F$ consist only of uppercase and lowercase English letters and digits.