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.
[[-41, -198, -103, 12, -98], [-36, -28, 19, 36], [-81, -16, -173, -180, -154, -77], [-66, 45, -87, -96, -11, -70], [-158, 94], [77, 29, -33, -65, -73], [-15, -8, -68, 33, -143, -36], [-78, 29, 67, 66]]