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: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

Output: [-66, -6, 91, 69, -24, 72]


Input: Consider Input: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

Output: [36, -23, 76, 20]


Input: Consider Input: [[-119, 67, -60, -36, -127, 80], [93, -138, -75], [-133, -110, 66, -171, -175, 45, -144], [45, 94], [-196, -66, -186, -104], [-174, 11, 80, -98], [-172, 90, 4, -117, -15]]


Output: [80, 93, 66, 94, -66, 80, 90]