Julie starts cell in infinite matrix from bottom left. Each cell is zero. The game consist of n steps.
During each step:
1: two int r ,c
2: Increments value of each cell such that : 1 <= i <= r and 1 <= j <= c
The fuction must return longer integer denoting total number of occurences of greates integer of grid after n steps.

Input: [(2,3),(3,7), (4,1)]
Output: 2
