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: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
Example Output: [-57, 95, 65, -1, 100, 55, 31, 94]

Example Input: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]
Example Output: [79, 24, 65, 25, 84]

Example Input: [[-103, -97, 23], [-141, 81, -167, -111, 75], [-173, 28, -68], [-42, -91, -200, 68, 48, -167], [-47, 61], [3, -75], [-40, 31, -149], [-68, -33, -196, -132]]
Example Output:
[23, 81, 28, 68, 61, 3, 31, -33]