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: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]
Example Output: [25, 59, -59, 90, 68, -84]

Example Input: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
Example Output: [55, 51, 83, 61, -9, 67, 15]

Example Input: [[98, -88, -189, -42, -83, -22, 64], [-193, -194, -27, -31, 31, -52, -88], [-105, 70, -61, -14], [-46, 55, 60], [95, -183, 19, -151, 12], [-164, -79, -134, 71, 77, -179], [-159, 50, 50, 40, -42, -195, 88], [14, -153, -152, 57, -19, -80, -110], [-123, -148, -51, 88, 4]]
Example Output:
[98, 31, 70, 60, 95, 77, 88, 57, 88]