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: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]
Example Output: [-11, 69, 79]

Example Input: [[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]
Example Output: [85, 74, 65, -115, 77, 91, 81, 94, 41]

Example Input: [[-54, -137, 99, -26], [-25, 92, -125, -152, 86, -29, -111], [-3, 67, -31, -83, 36, -42, 64], [57, -174, -176, -96, -179, -147, 90], [75, -153, -95, -8, -28], [76, -51, -101, -188, -91], [-166, 51, -31], [-148, -139, -69, 41], [-152, -96, 50]]
Example Output:
[99, 92, 67, 90, 75, 76, 51, 41, 50]