Input: input consists of up to 10 test cases. each case starts with a line containing a pair of integers w and h giving the size of the new office space (w is the number of feet west-to-east, h is the number of feet south-to-north). both of these numbers are in the range 1 to 100.after this is a line containing an integer n between 1 and 20 inclusive, giving the number of employees you have. following this are n cubicle placement requests, one per line. each request starts with the name of the employee. the name is a string of 1 to 20 characters (mix of upper and lower case letters a-z, no spaces). the name is followed by four integers x1, y1, x2, y2 where (x1, y1) indicate the coordinates of the south-west corner of the desired cubicle and (x2, y2) indicate the coordinates of the north-east corner. each set of request coordinates satisfies 0 ≤ x1 ≤ x2 ≤ w and 0 ≤ y1 ≤ y2 ≤ h. the sequence of test cases ends at the end of file. output: for each test case, print out a report that starts with the total number of square feet in the building and the number of square feet that no employee has requested (the unallocated space).next give the total number of square feet that are contested because more than one empoyee has requested the same region of the floor. finally, for each employee give the number of square feet that that employee can be guaranteed to have. this is the total area that they requested minus any regions that were requested by another employee. list the employees in the same order they were given in the input. leave a blank line after the output for each test case.