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: [[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]
Example Output: [57, 61, 36, 78]

Example Input: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
Example Output: [99, 68, -32]

Example Input: [[50, -44, -157, -11], [-163, -154, -165, 49, -89, -194, 9], [-48, 15, -79, -85], [33, -145, -92], [82, -14, -191, -91]]
Example Output:
[50, 49, 15, 33, 82]