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.

[[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
[95, 58, 72, 99, 80, 89, -18, -25]

[[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]
[99, 32]

[[27, 89, -187, 45, -105, -62], [-56, -9], [-57, 55, 96, -129, 97, -165, 54], [-102, -153, -150, -146, -188, 11, -84], [5, -108, -52, 77, 2, -200], [-7, -82]]

[89, -9, 97, 11, 77, -7]