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.

[[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[61, 73, 78, 71, -99, 88, -30]

[[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]
[-42, 73, 85, 76]

[[-78, 45], [-124, 37, 96, 43], [-24, -6, -137], [-99, -191, -101, -52], [-9, -100, -193, 24, -31, -112]]

[45, 96, -6, -52, 24]