In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

Input: Consider Input: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

Output: [77, 81, 85, 93, 54, 88]


Input: Consider Input: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]

Output: [-135, 19, -152, -91, 22, -152]


Input: Consider Input: [[-178, -130, -87, -55, 2, -134, -123], [-128, -37, -147, 20], [-126, -77, 16, -10, -141, -192, 19], [-58, -59, -142, 70]]


Output: [2, 20, 19, 70]