Problem Description
There are N lamps in a line and M switches control them. Each switch is connected to a subset of these lamps. When a switch is flipped, all the lamps connected to it change its state (on to off and off to on).
Input
The input contains multiple test cases. Each test case starts with two integers N and M (0<N<=50, 0<M<=100), which stand for the number of lamps and swithes. Then M lines follows, each line contains N characters. The jth character of the ith line is '1' if the ith switch is connected to the jth lamp, and '0' otherwise. The next line is a integer Q, which is the number of queries. Each of following Q lines contains the initial and target state of lamps ('0' is off and '1' is on).
Output
For each query, output "Yes" if it is possible to change the state from initial to target with these swithes. Otherwise, output "No".
Sample Input
5 3
00000
10101
01010
3
00000 11111
10101 01010
11111 10001
Sample Output
Yes
Yes
No
