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.
[[-109, -198, -168, -30, -46, -87], [-2, -164, 95, -105, -183], [-65, -100, -97], [38, 100, -159, 47, -126, -57], [100, 42, -47, -83, -121, -130], [68, 65, -12, -182], [77, -119, 7, 56, -36, -112], [30, -81]]