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.

[[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[75, 51, 10, 53, -43, 17, -111]

[[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]
[76, 28, -16, 28, 74]

[[62, -188, -78, -144, -149], [69, 94, 24], [-54, 29, -183, -180, 65, -64], [73, 100, -4, -100, -163, -124, -24], [-150, 7], [94, 93, 86, -112], [80, -160, -112]]

[62, 94, 65, 100, 7, 94, 80]