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: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]
Example Output: [-17, 5, 41, 4, -46, 80, 92, 65, 69]

Example Input: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]
Example Output: [42, -49, 94, 89, -73, 5, -41, 89]

Example Input: [[-161, -19, -113], [-102, -47, -115, -17], [-65, -197, -180, -186, -106], [-157, -188, -120], [12, -18]]
Example Output:
[-19, -17, -65, -120, 12]