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: [[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]
Example Output: [12, 69, -30, -7]

Example Input: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
Example Output: [58, 19, 68]

Example Input: [[-156, -96, -33, -119], [-46, 89, 15, -142, 43, -27, -78], [-54, -121, 71, 78], [-74, 53, -59, -161, -75], [-74, 53, 0, -71, -5, -179]]
Example Output:
[-33, 89, 78, 53, 53]