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.
[[-193, -135, -52, -16, 34, 94], [-141, -59, 95, -114, -45], [63, -34, 22, -199], [41, -176], [9, -174, 37, 53, -118], [-21, 42, 57, -142, -20], [-116, -172, 93, -193], [72, -127, 3, 60, -63, -25]]