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.
[[35, 100, -101, -139, 91, -124], [-197, 23, -163, -152], [-11, -16, -163, -27, -20, 94], [-151, -6, -17, -182, -200, -31, -134], [50, -172], [77, 35, -49, -182, -171, -120], [68, -40, -65, -192, -110, -190]]