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.

[[-144, -114, 61, -172, 43, 35, 40], [82, 54, -184, -82, -75, -105, 97]]
[61, 97]

[[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
[100, 97, 77, 11, 52, 74, 99, -25, 8]

[[42, 80], [-168, -90, -19, -130], [-187, -130, 67, -139, -95, -141, 80], [-23, -40, -122, -96, -18, -89, 85], [69, -192, 47, -18], [-95, -165], [69, -167, -24, -85, -13], [99, -73], [-102, -108, -45, -148, -98, -7]]

[80, -19, 80, 85, 69, -95, 69, 99, -7]