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: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]
Example Output: [-11, 69, 79]

Example Input: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]
Example Output: [80, 56, 46, 29, 14]

Example Input: [[11, 97, 14, -2, -79, -175], [-6, -22], [50, -9, -63], [31, -15, 1], [-129, -41, -122, -87, -97, 12], [20, -114, 61, -122, 20, -38], [-67, -26, -3, -84]]
Example Output:
[97, -6, 50, 31, 12, 61, -3]