题号：NC53391
时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
题目描述
Bobo has n m-tuple 
, where )
. He wants to find )
which is the number of 
where 
has odd number of ones in its binary notation for all j. Note that 
denotes the bitwise-and.
Find%20%5Ccdot%203%5Ex)
modulo )
for given k.
Find
输入描述:
The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains three integers n, m and k.
The ith of the following n lines contains m integers.
*
*
*
*.
* There are at most 100 test cases, and at most 1 of them haveor m > 5.
输出描述:
For each test case, print an integer which denotes the result.