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: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]
Example Output: [-19, 15, 24, 84, -138, 76]

Example Input: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
Example Output: [81, 84, -3, 93, -41, 21, 6, 87, -16]

Example Input: [[56, 55, -49, 92, -129, -9, 78], [-189, 79, -55], [-127, 39, -146, -12, -123, 98, 67], [87, -157, 23, 28]]
Example Output:
[92, 79, 98, 87]