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: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
Example Output: [98, 56, 93, 13, 28, 59, 74]

Example Input: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
Example Output: [25, 32, 86, 96, -33, 84, 93]

Example Input: [[-178, -171, -200, -191, -143], [-183, -18, -91], [-150, -133, -157], [97, -54, -179, -22, -161], [-58, -19, -36, -179], [90, -126, -193, 64, 56], [-99, -54], [-177, -51, -185, -82, -51, -51, 48], [25, -121, -99, 73, 93]]
Example Output:
[-143, -18, -133, 97, -19, 90, -54, 48, 93]