题号：NC51078
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
64bit IO Format: %lld
题目描述
Given a n × n matrix A and a positive integer k, find the sum 
.
输入描述:
The input contains exactly one test case. The first line of input contains three positive integers n, k
and m
. Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.
输出描述:
Output the elements of S modulo m in the same way as A is given.