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.
[[16, -79, -14, -196], [-132, -23, -26, 100, 33], [-197, 14, -69, -132, -38, 97], [0, -64, -110, -18, -122, 57, 24], [91, -112], [-40, -128, -12, -146, -44, -188, -76], [-110, -186, -107, 6, -94, -168], [45, -78, -116, -63], [52, 9, -58, -98]]