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.

Example Input: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]
Example Output: [36, 40, 84]

Example Input: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]
Example Output: [87, 7, 73, 69, 96, -106, 48, 84]

Example Input: [[-102, -179, 52], [-103, -180, -161, -110, -17, -167, 8], [35, -59, 10], [90, -75, -60, -78, -71, -139], [-135, 67, 93], [-122, -68, -106], [-122, -18], [-44, -144, 72]]
Example Output:
[52, 8, 35, 90, 93, -68, -18, 72]