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.
[[-156, 59, -75, -69], [-34, -143], [91, 81], [-115, -71], [-3, -70], [-198, 71, 51, 30], [68, -75, 36, -150, -19, -110, -141], [-114, -175, -78, -59]]