## 描述

White Rabbit has a rectangular farmland of n*m. In each of the grid there is a kind of plant. The plant in the j-th column of the i-th row belongs the a[i][j]-th type.
White Cloud wants to help White Rabbit fertilize plants, but the i-th plant can only adapt to the i-th fertilizer. If the j-th fertilizer is applied to the i-th plant (i!=j), the plant will immediately die.
Now White Cloud plans to apply fertilizers T times. In the i-th plan, White Cloud will use k[i]-th fertilizer to fertilize all the plants in a rectangle (x1[i]…x2[i])(y1[i]…y2[i]).
White rabbits wants to know how many plants would eventually die if they were to be fertilized according to the expected schedule of White Cloud.

### 输入

The first line of input contains 3 integers n,m,T(nm<=1000000,T<=1000000)
For the next n lines, each line contains m integers in range[1,n
m] denoting the type of plant in each grid.
For the next T lines, the i-th line contains 5 integers x1,y1,x2,y2,k(1<=x1<=x2<=n,1<=y1<=y2<=m,1<=k<=n*m)

### 输出

Print an integer, denoting the number of plants which would die.

2 2 2
1 2
2 3
1 1 2 2 2
2 1 2 1 1

3

PS: