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.
[[96, -100, -102, 19, -46, 60, -31], [-70, 93], [-194, 33, -133, 96, -169], [-14, -182, 51, -200, -179, 9], [12, -63, -92], [-112, -75, -52, 81, -50], [-44, 40, -67, -143, -84, -33, -122]]