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.

[[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]
[59, -12, -25]

[[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]
[57, 80, -20, -50, 8, 64]

[[-190, 50, -149, -98], [5, -147, 92, 0, 95, -83, 88], [-35, -142, 22, -79, -46, -64, 4], [-108, -146, 13, -139], [-85, 61]]

[50, 95, 22, 13, 61]