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.
[[-106, -195, 38, -52], [-63, 30, -135, -31], [-70, 58, 83], [-71, 18, -61, 91, 84, -183, -95], [-139, 29, -29, 68, 98, -4, -73], [45, -199, -91], [-42, -65, 80, -1, -180, -174, -184], [-99, 63, -157, 36, 87, 30]]