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: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

Output: [55, 21, 75, 84]


Input: Consider Input: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]

Output: [0, 22, 17, 48, 80]


Input: Consider Input: [[-113, -166], [-67, -187, -195], [-92, -69], [-59, -57, 0, 8], [25, -189, -123, -8, -111], [100, -196, 39, -145, -87, -1, -127]]


Output: [-113, -67, -69, 8, 25, 100]