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.
[[99, -104, 63], [-3, -47, 12], [100, -181, -64], [-3, -174, -132, 10], [-75, 25, -21, 48, -197, 68, 62], [38, -92], [-171, -138, -142, 71], [-150, -54, -141, 42, -143, 6, 16]]