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.
[[-180, -104, -150, -189], [8, -191, -95, -25, 59, 86], [-71, 94, -39, -146, -59, -103, 70], [-75, 35, -70], [66, 69, 96, -134, 5, -55, 69], [30, 90, -122, -137, -112, -114, -103], [-69, -173, -31, 11, -187], [52, -117, 89, -169, 59, -150], [-76, 78, -71]]