You have a rectangular $*n* × *m*$-cell board. Some cells are already painted some of $*k*$ colors. You need to paint each uncolored cell one of the $*k*$ colors so that any path from the upper left square to the lower right one doesn't contain any two cells of the same color. The path can go only along side-adjacent cells and can only go down or right.
Print the number of possible paintings modulo $1000000007$ $(10^{9} + 7)$.
Input
The first line contains three integers $*n*, *m*, *k*$ $(1 ≤ *n*, *m* ≤ 1000, 1 ≤ *k* ≤ 10)$. The next $*n*$ lines contain $*m*$ integers each — the board. The first of them contains $*m*$ uppermost cells of the board from the left to the right and the second one contains $*m*$ cells from the second uppermost row and so on. If a number in a line equals 0, then the corresponding cell isn't painted. Otherwise, this number represents the initial color of the board cell — an integer from 1 to $*k*$.
Consider all colors numbered from 1 to $*k*$ in some manner.
Output
Print the number of possible paintings modulo $1000000007$ $(10^{9} + 7)$.
样例
2 2 4
0 0
0 0
48
2 2 4
1 2
2 1
0
5 6 10
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
3628800
2 6 10
1 2 3 4 5 6
0 0 0 0 0 0
4096
题面与样例版权归 Codeforces 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。