시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
8 초 512 MB 0 0 0 0.000%

## 문제

Rikka is a rich girl.

She would like to visit the beautiful cities of China. The city locations in China can be simply regarded as a grid that contains $n$ rows and $m$ columns. Rows are numbered by $1$ to $n$ from north to south, and columns are numbered by $1$ to $m$ from west to east. The city located in the $i$-th row and the $j$-th column is called $(i, j)$.

There are some expressways that connect the whole country. City $(i, j)$ has a direct expressway to city $(x, y)$ if and only if $|i - x| + |j - y| = 1$. Because New Year is coming, expressways are opened to the public free of charge.

When Rikka travels from city $(i, j)$ to $(x, y)$, she can only travel through expressways. The cost of a travel route is the sum of the costs of all the cities she visits, including the starting and the ending cities. If the route includes some city, she will visit scenic spots, go shopping, and spend money. If the route includes city $(i, j)$, she will spend $a_{i, j}$ yuan. And if she visits city $(i, j)$ a total of $k$ times, she will spend $k \cdot a_{i, j}$ yuan, because there are always enough shopping malls for her to spend money.

Rikka is a fanciful girl, she does not even set the starting and the ending city. She wants to know the sum of costs of all the cheapest routes with different starting and ending cities. In other words, let $f (i, j, x, y)$ be the minimal cost of the route that starts from city $(i, j)$ and ends at city $(x, y)$. She wants to know the value $$\sum \limits_{i = 1}^n \sum \limits_{x = 1}^n \sum \limits_{j = 1}^m \sum \limits_{y = 1}^m [(i, j) \neq (x, y)] f (i, j, x, y)\text{.}$$

Because the answer may be very large, you just need to tell her the answer modulo $1\,000\,000\,007$ (that is, $10^9 + 7$).

## 입력

The first line contains two integers $n$ and $m$.

Each of the following $n$ lines contains $m$ integers. The $j$-th number in the $i$-th line is the value of $a_{i, j}$.

It is guaranteed that $n = 3$, $1 \le m \le 1.5 \cdot 10^5$, and $1 \le a_{i, j} \le 10^9$.

## 출력

Output a single line with a single integer, the answer modulo $1\,000\,000\,007$ (that is, $10^9 + 7$).

## 예제 입력 1

3 3
1 1 1
1 100 1
1 1 1


## 예제 출력 1

1808