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: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]
Example Output: [79, 56, -1, 85, 89, 61, -62, 31]

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: [[36, -42, -6, -31, -194], [-182, -19], [-78, -195, -171, 38], [-156, 73, -143, -99, -79], [100, -67, -186, -111, 0, 71], [-94, 92], [-136, -154, -155, -74]]
Example Output:
[36, -19, 38, 73, 100, 92, -74]