1 \(s / 64\) \(MB / 100\) points

Mirko has found a matrix with \(N\) rows and \(M\) columns at the back seat of his car. The first

row of the matrix consists of numbers 1, 2, ... \(M\) , the second row of numbers \(M\) +1, \(M\) +2, ...

2⋅ \(M\) and so on until the \(N\) ^{th} row which consists of numbers ( \(N\) -1)⋅ \(M + 1\), ( \(N\) -1)⋅ \(M + 2\), ...

\(N\) ⋅ \(M\) , respectively.

For example, for \(N\) = 3 and \(M\) = 4:

1
2
3
4
5
6
7
8
9
10
11
12

Such matrix wasn’t interesting enough to him, so he chose a row or a column \(K\) times and

multiplied its values with a n\(on-ne\)gative integer.

Naturally, now he wants to know the sum of all the values from the matrix. Since this sum

can be very large, Mirko will be satisfied with the value modulo 10 ^{9} + 7. Help Mirko answer

this question.

In test cases worth a total of 50 points, it will hold 1 ≤ \(N\) , \(M\) ≤ 1000.

1 \(s / 64\) \(MB / 100\) points

The first line of input contains the numbers \(N\) (1 ≤ \(N \le 1\,000\,000\)), \(M\) (1 ≤ \(M \le 1\,000\)

000) and \(K\) (1 ≤ \(K\) ≤ 1000) from the task.
Each of the following \(K\) lines describes:
●
Either the multiplication of the \(X\) ^{th} row with \(Y\) , in the form of "R \(X\) \(Y\) ", where “R”

represents row multiplication, \(X\) is a positive integer (1
≤
\(X\)
≤
N), and \(Y\) is a

n\(on-ne\)gative integer (0 ≤ \(Y\) ≤ 10 ^{9}{ }).
●
Or the multiplication of the \(X\) ^{th} column with \(Y\) , in the form of “S \(X\) \(Y\) ”, where “S”

represents column multiplication, \(X\) is a positive integer (1
≤ \(X\) ≤ \(M\) ), and \(Y\) is a

n\(on-ne\)gative integer (0 ≤ \(Y\) ≤ 10 ^{9}{ }).

You must output the sum of the final values from the matrix modulo 10 ^{9}{ } + 7.

생성자가 기록되지 않았습니다.

출처 COCI 2017/2018 Contest 4