t = input()
t = t.split(' ')
count = 0
d = []
for i in range(int(t[0])):
s = []
for j in range(int(t[1])):
s.append(0)
d.append(s)
s=0
for i in range(int(t[2])):
c = input()
c = c.split(' ')
if int(c[0]) == 1:
if d[int(c[1]) - 1][int(c[2]) - 1] == 0:
d[int(c[1]) - 1][int(c[2]) - 1] = 1
else:
d[int(c[1]) - 1][int(c[2]) - 1] = 0
elif int(c[0]) == 2:
s+=1
if s%2==0:
for i in range(len(d)):
for j in range(len(d[i])):
if d[i][j] == 1:
count += 1
else:
continue
else:
for i in range(len(d)):
for j in range(len(d[i])):
if d[i][j] == 0:
count += 1
else:
continue
print(count)
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |