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: [[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: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
Example Output: [17, 85, 20, 70, 12, 73, 90, 59, 58]

Example Input: [[8, 80, 56, -164, -16, -4], [31, -131], [-185, 5], [-29, -25], [-110, 26, 74, -43, -179, -148]]
Example Output:
[80, 31, 5, -25, 74]