B"Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task. You are given two matrices A and B of size n x m , each of which consists of 0 and 1 only. You can apply the following operation to the matrix A arbitrary number of times: take any submatrix of the matrix A that has at least two rows and two columns, and invert the values in its corners (i.e. all corners of the submatrix that contain 0 , will be replaced by 1 , and all corners of the submatrix that contain 1 , will be replaced by 0 ). You have to answer whether you can obtain the matrix B from the matrix A . Ramesses don't want to perform these operations by himself, so he asks you to answer this question. A submatrix of matrix M is a matrix which consist of all elements which come from one of the rows with indices x_1, x_1+1, ldots, x_2 of matrix M and one of the columns with indices y_1, y_1+1, ldots, y_2 of matrix M , where x_1, x_2, y_1, y_2 are the edge rows and columns of the submatrix. In other words, a submatrix is a set of elements of source matrix which form a solid rectangle (i.e. without holes) with sides parallel to the sides of the original matrix. The corners of the submatrix are cells (x_1, y_1) , (x_1, y_2) , (x_2, y_1) , (x_2, y_2) , where the cell (i,j) denotes the cell on the intersection of the i -th row and the j -th column. The first line contains two integers n and m ( 1 <= q n, m <= q 500 ) -- the number of rows and the number of columns in matrices A and B . Each of the next n lines contain m integers: the j -th integer in the i -th line is the j -th element of the i -th row of the matrix A ( 0 <= q A_{ij} <= q 1 ). Each of the next n lines contain m integers: the j$"...