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.

[[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]
[4, 95, 28, 51, -75, 76, 64, 9]

[[-106, -107, 85, 70, 87, -119, -149], [-41, -103]]
[87, -41]

[[-189, -200, -104, -39, -179, -15], [-129, -86, 12, 79], [-19, -154, -146, -108, -45, -6, -186], [75, 65, -27, -159, -33, 27, 2], [-142, 36, -1], [90, -138]]

[-15, 79, -6, 75, 36, 90]