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: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
Example Output: [66, 16, 16, 69, 12, 80]

Example Input: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]
Example Output: [85, 82, 95, -111, 24, -112, 65, 65, 16]

Example Input: [[-198, -106, -69, 16, 85, 82], [-35, -15, 61, -69], [-51, 30, 69, -38], [-113, 71, -52], [-58, -79, -137, -93, -142, -89], [-191, 78, -96, -159, -46, 73, 38], [11, -13, -151, -175, -100, 74, 41], [-55, -178, -114, 30, 91, -195, 85]]
Example Output:
[85, 61, 69, 71, -58, 78, 74, 91]