PROGRAMMING:Mini search engine
To achieve a simple search engine function, quickly meet up to $$10 ^ 5 $$keyword query requests.
###Input format:
Input first gives a positive integer n ($$$Le $$100), which is the total number of files. Then the content of each file is given in the following format: the title of the file is given in the first line, then the body of the file is given in no more than 100 lines, and finally only one character '#' is given in one line to indicate the end of the file. No more than 50 characters per line. At the end of N files, the total number of queries m ($$$Le 10 ^ 5 $$) is given, followed by M lines, each line gives no more than 10 English words, separated by spaces, each word no more than 10 English letters, case insensitive.
###Output format:
For each query, first output the total number of files containing all the query words in one line; If the total number is 0, output 'not found'. If the qualified files are found, they will be output in the order of input. The format is: the first line outputs the file title; Then, the contents of those lines containing the query words are sequentially output. Note that you cannot output the same line repeatedly.
###Input example:
```in
four
A00
Gold
silver truck
#
A01
Shipment of gold
damaged
in a fire
#
A02
Delivery
of silver
arrived in
a silver
truck
#
A03
Shipment of gold
arrived in
a truck
#
two
what ever
silver truck
```
###Output example:
```out
0
Not Found
two
A00
silver truck
A02
of silver
a silver
truck
```
answer：If there is no answer, please comment
###Input format:
Input first gives a positive integer n ($$$Le $$100), which is the total number of files. Then the content of each file is given in the following format: the title of the file is given in the first line, then the body of the file is given in no more than 100 lines, and finally only one character '#' is given in one line to indicate the end of the file. No more than 50 characters per line. At the end of N files, the total number of queries m ($$$Le 10 ^ 5 $$) is given, followed by M lines, each line gives no more than 10 English words, separated by spaces, each word no more than 10 English letters, case insensitive.
###Output format:
For each query, first output the total number of files containing all the query words in one line; If the total number is 0, output 'not found'. If the qualified files are found, they will be output in the order of input. The format is: the first line outputs the file title; Then, the contents of those lines containing the query words are sequentially output. Note that you cannot output the same line repeatedly.
###Input example:
```in
four
A00
Gold
silver truck
#
A01
Shipment of gold
damaged
in a fire
#
A02
Delivery
of silver
arrived in
a silver
truck
#
A03
Shipment of gold
arrived in
a truck
#
two
what ever
silver truck
```
###Output example:
```out
0
Not Found
two
A00
silver truck
A02
of silver
a silver
truck
```
answer：If there is no answer, please comment