题号：NC213129
时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Bobo has a matrix of size 
filled with integers. It is guaranteed that all cells which contain the same value are 4-side connected.
Let's define a *bounding box*
of a connected component with value x as minimum-area rectangle (with sides parallel to the matrix sides) that covers all cells of the component.
For each bounding box, Bobo would like to find the value of
%3D%5Csum_%7BB_y%20%5Cin%20A%20%5Csetminus%20%5C%7Bx%5C%7D%7D%20f(B_x%2C%20B_y)%20%5Ccdot%20y)
where A is the set of all integers in the matrix and
%3D%5Cbegin%7Bcases%7D%0A0%20%26%20%5Ctext%7B%20the%20area%20of%20intersection%20of%20%7D%20B_x%20%5Ctext%7B%20and%20%7D%20B_y%20%5Ctext%7B%20is%20%7D%200%20%5C%5C%0A0%20%26%20B_x%20%5Ctext%7B%20is%20completely%20inside%20%7D%20B_y%20%5Ctext%7B%20or%20vice%20versa%7D%20%5C%5C%0A1%20%26%20%5Ctext%7BOtherwise%7D%0A%5Cend%7Bcases%7D)
Let's define a *bounding box*
For each bounding box
where A is the set of all integers in the matrix and
输入描述:
The input consists of several test cases terminated by end-of-file. For each test case:
The first line contains two integers n and m -- the size of the matrix.
The second line containsintegers
,
,
,
, where
is the value in the i-th row and the j-th column.
*
*
* It is guaranteed that all cells which contain the same value are 4-side connected.
* It is guaranteed that the sum of.
输出描述:
For each test case, output an integer denoting the value of, where
denotes the exclusive-or (XOR) operator.