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.

[[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]
[65, 45, 9]

[[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]
[-6, 51, 71, 98, -30, 26]

[[-44, -184, -182, -15], [-169, -157, 95, -38, -181, 40], [87, -63], [-135, 58, 70, -29, -125, -175, -35], [74, -146, -165], [-175, -192, -40, 18, 66, -11, -139], [-32, -198, -198, -136, 48, -162, 10]]

[-15, 95, 87, 70, 74, 66, 48]