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.
[[-61, 7, 69, 6, -37], [-7, -82, 0], [-7, -78, -85, -29, 66, 50, -135], [34, -157, -198, -3, -91], [-124, -63, -141, -98, -188, -63], [-188, 71, -49, -13, -197], [76, 7, -159]]