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.

Example Input: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]
Example Output: [25, 59, -59, 90, 68, -84]

Example Input: [[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
Example Output: [-26, 0, 75]

Example Input: [[-85, -37], [-49, 58, -140, -147, 71, -90], [38, -44, 61], [-88, -18, 41, -195], [-71, -101, 16, 27], [-33, -20, -74], [42, -26, -195, -141, -189, -90, 83], [-162, -193, 11, -143, 100, -96], [68, -171, 96]]
Example Output:
[-37, 71, 61, 41, 27, -20, 83, 100, 96]