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: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

Output: [98, -25, 42, -101, 76, 92, 82, 53, 53]


Input: Consider Input: [[-197, 66, -167, -26], [-189, -91], [-137, 69, 37, -191, -156], [-103, 47, 40], [-104, -114, -67, 15], [-160, -126, 80, 92, 24, 83]]


Output: [66, -91, 69, 47, 15, 92]