Sub-rectangle Counting Problem

Problem Statement

Jane is solving aptitude questions as she is preparing for competitive exams. She came across a question where the dimensions of a rectangle were given, and the possible number of sub-rectangles that can be created within that rectangle (including itself) had to be found. She is now wondering if a generic solution can be found for this problem. Can you write a program to help her? Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the standard output and test cases will fail. Constraints: 0 < L < 10^5 0 < W < 10^5 Input format: Single line of input consists of two integers L and W which are the length and width of the rectangle. Output format: Single line of output has the number of sub-rectangles that can be created within the rectangle. Sample Input 1: 2 2 Sample Output 1: 9 Explanation: From the given dimension, length and width are 2 and 2 respectively. The following sub-rectangles can