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: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
Example Output: [89, 47, 19, -36]

Example Input: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]
Example Output: [55, -15, 19, 99, 91, 85]

Example Input: [[66, 10, -186, -151, 34], [-114, -68, 3, 78, 23, 38], [-153, -6, -141, -166, -95], [42, -169, -55, -76], [-115, -122, -102, -107, 66], [42, -166, -186, -46, -174, -89]]
Example Output:
[66, 78, -6, 42, 66, 42]