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.
[[95, 87, 41, 40, 60, -12, -159], [36, -23, -6, -179, -66, -180, 85], [49, -179], [76, 16, 14], [-85, -79, 25, -180, -174], [-200, -159, -29, -95, -150, 65, -88], [-28, 28]]