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.
[[82, -152], [-141, 88, -183, 66, 38, -139, -157], [-174, -171, -122, 87, -94, -197, -175], [93, -96, 52], [62, -96, -184, -78, -10, 23, -88], [-2, -61, -121, -199, 24], [-18, -29], [-139, -182, 26], [95, -53, 58, -129]]