PROGRAMMING:Simple questions
Each time$$ If you chat with $$YCJ $, you will feel that he is a fool, because $$bear $$$$ When the message sent by $$goes into the brain of $$YCJ $$, it will be automatically translated into another meaning.
Simplified as a $$01 $$string sent to $$YCJ $$brain will automatically become another $$01 $$string may also remain unchanged.
Now $$YCJ $$has received $$n $$messages of length $$len $$, $$bear $$$$ 2 $$wants to know the maximum similarity between the message $$s $$sent by him and the $$n $$message received by $$YCJ $$.
In order to judge the similarity of messages, we define a binary function $$f (s, t) $, which means the same number of $$01 $$string $$s $$and $$01 $$string $$t $$in the $$K (1 < = k < = len) $$
###Input format:
In the first line, three positive integers, $$n, len, q (1 < = n, Q < = 1000, 1 < = len < = 20) $$are given, which respectively represent the number of received messages and the length of received messages, $$bear $$$$ 2 $$.
The next $$n $$lines give a string of length $$len $$
The next $$q $$line gives the query string of length $$len $$.
###Output format:
For each query, the maximum value of the similarity between the query string and the received string is output in one line.
###Input example:
Here is a set of inputs. For example:
```in
3 2 3
00
01
eleven
ten
01
eleven
```
###Output example:
The corresponding output is given here. For example:
```out
one
two
two
```
###Tips:
In the example, $$00,01,11 $$are received.
When $$10 $$is asked, the similarity with $$00 $$is 1, the similarity with $$01 $$is 0, and the similarity with $$11 $$is 1. So the maximum similarity is 1.
Guarantee 20% data, $$(1 < = n, Q < = 10)$$
Guarantee 60% data, $$(1 < = n, Q < = 100)$$
Guarantee 100% data, $$(1 < = n, Q < = 1000)$$
answer：If there is no answer, please comment
Simplified as a $$01 $$string sent to $$YCJ $$brain will automatically become another $$01 $$string may also remain unchanged.
Now $$YCJ $$has received $$n $$messages of length $$len $$, $$bear $$$$ 2 $$wants to know the maximum similarity between the message $$s $$sent by him and the $$n $$message received by $$YCJ $$.
In order to judge the similarity of messages, we define a binary function $$f (s, t) $, which means the same number of $$01 $$string $$s $$and $$01 $$string $$t $$in the $$K (1 < = k < = len) $$
###Input format:
In the first line, three positive integers, $$n, len, q (1 < = n, Q < = 1000, 1 < = len < = 20) $$are given, which respectively represent the number of received messages and the length of received messages, $$bear $$$$ 2 $$.
The next $$n $$lines give a string of length $$len $$
The next $$q $$line gives the query string of length $$len $$.
###Output format:
For each query, the maximum value of the similarity between the query string and the received string is output in one line.
###Input example:
Here is a set of inputs. For example:
```in
3 2 3
00
01
eleven
ten
01
eleven
```
###Output example:
The corresponding output is given here. For example:
```out
one
two
two
```
###Tips:
In the example, $$00,01,11 $$are received.
When $$10 $$is asked, the similarity with $$00 $$is 1, the similarity with $$01 $$is 0, and the similarity with $$11 $$is 1. So the maximum similarity is 1.
Guarantee 20% data, $$(1 < = n, Q < = 10)$$
Guarantee 60% data, $$(1 < = n, Q < = 100)$$
Guarantee 100% data, $$(1 < = n, Q < = 1000)$$
answer：If there is no answer, please comment