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.

[[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[52, 80, 98, 38, 69, 81, 8, 64]

[[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]
[70, 56, -22]

[[-152, 80], [-45, 85], [-97, -41, -159, -25], [99, -141, -119, -106, 9, 50, 12], [-102, -12, -13, -17, -75, -43, 56], [4, 30, 10, -31, 50, -51], [-195, -186, -163, -46, -130, 42, -62]]

[80, 85, -25, 99, 56, 50, 42]