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.
[[10, -145, -93, -199], [-135, 40, -65, 96], [-120, 52, -197, 44, 29], [-127, -80], [-141, 44, 60, -2, -55], [-64, -5], [-33, -111, -165, -52, -79, -100], [6, -38, -196, -95, 25, -177], [87, -51]]