There is a 2D plane of size N* M. There is fire which is there at K different points in the 2D plane. From each of these K points, the fire is spreading in a circular form with the radius of the fire increasing by time. So, if at t=1, the radius if fire was 2, at t=2, it becomes 4, at t=3, it become 6 and so on. "t" denotes time here.\nHelp us determine, the number of points (points are denoted by {x,y}, where both x and y are whole numbers, and are within the plane) which would not be touched by the fire\nConstraints\n1 <= N <= 1000\n1<= M <= 1000\n1<=K<=5\n1 <= R <= 10\n1 <= T <= 100\n\nCouldn\'t take screen shot of example testcases.

There is a 2D plane of size N* M. There is fire which is there at K different points in the 2D plane. From each of these K points, the fire is spreading in a ci