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.
[[-73, 23, -27, -80, -99], [-98, -42, 16, -59, -48, 13, -62], [-104, -69, -26, 95, -200], [81, -156, -21, -83, 2, -108], [77, -140, -16, 17, -182, -74, -120], [76, -116], [-196, 73, -100, -102, -84, -193, 38], [-92, 98, -91, -164], [-103, -32, 26, -22, -161]]