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]

[[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[-61, -68, -103, 97]

[[-36, -167, -129, 94, -181, -133], [89, -129, -162, -48], [-183, -146], [94, 100], [-24, 62, -21, -117, 33, -108], [-166, 2, -74], [-38, -112, 9]]

[94, 89, -146, 100, 62, 2, 9]