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.
[[15, -178, 42, -102, -16, 53, -178], [-200, -22, -96, 84, 39], [-79, 39, -109, -85, 50, -114], [30, -58, -97, 80, -127, -65], [25, 14, -45, -133, -200, 55], [-200, -94, 83, -64, -84, 81], [-6, -137, -196, -71], [-102, 34]]