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.
[[14, -35, 9], [38, 29], [19, -10, 26, 38], [51, 52, -153, 44, 27, 14], [-41, -177, 85, -8, -180], [-136, -199, -108], [-196, -26, -41, 64], [-135, 3, -121, 82, 31], [-148, -63, 26, -129, -93, -140, -129]]