描述
Bosko and Susko are playing an interesting game on a board made of rectangular fields arranged in A rows and B columns.
When the game starts, Susko puts its virtual pillbox in one field one the board. Then Bosko selects fields on which he will throw his virtual bombs. After each bomb, Susko will tell Bosko whether his pillbox is in the range of this bomb or not.
The range of a bomb with diameter P (P is always odd), which is thrown in field (R, S), is a square area. The center of the square is in the field (R, S), and the side of the square is parallel to the sides of the board and with length P.
After some bombs have been thrown, Bosko should find out the position of Susko's pillbox. However, the position may be not unique, and your job is to help Bosko to calculate the number of possible positions.
输入
First line of input contains three integers: A, B and K, 1 <= A, B, K <=100. A represents the number of rows, B the number of columns and K the number of thrown bombs.
Each of the next K lines contains integers R, S, P and T, describing a bomb thrown in the field at R-th row and S-th column with diameter P, 1 <= R <= A, 1 <= S <= B, 1 <= P <= 99, P is odd. If the pillbox is in the range of this bomb, T equals to 1; otherwise it is 0.
输出
Output the number of possible fields, which Susko's pillbox may stay in.
翻译：
描述
Bosko和Susko正在玩一个有趣的游戏，这个游戏在一块A行B列的矩形板上进行。
游戏开始时，Susko会想一个自己的“碉堡”要放的位置，然后Bosko会选择他要在哪里放下自己的“炸弹”。每个“炸弹”放下后，Susko会告诉Bosko他的“碉堡”是否在“炸弹”的范围内。
当“炸弹”被放在点（R,S）上时，轰炸范围是一个边与矩形板平行、边长为P（P是奇数）的正方形。
放下一些“炸弹”后，Bosko需要找出Susko的“碉堡”所在的位置。但“碉堡”的位置可能不唯一，你要做的就是帮助Bosko计算出“碉堡”可能位置的数量。
输入
第一行包括三个整数：A,B和K，1 <= A,B,K <=100.A为矩形板的行数，B为矩形板的列数，K为要放下的“炸弹”数量。
接下来的K行包括整数R,S,P和T，表示“炸弹”被放在第R行、第S列，范围边长是P，1 <=R<=A,1<=S<=B,1<=P<=99,P是奇数。如果“碉堡”在这个炸弹的范围之内，T变为1；否则T是0.
输出
输出Susko的“碉堡”可能存在的位置数量。