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.
[[-175, -161, -85, 30, -60, -80, -111], [36, -89], [-189, 1, -167, -61], [75, -182, 68, 54, -59, 31, 21], [24, 22, -138, 0, -185, 53, -199], [3, 87, -98, 77, -40, -15, -179], [-85, -90, 13, 24, 66, -129], [79, -120, 34, -188]]