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: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
Example Output: [51, 69, 92, 52, 82, 70, 65]

Example Input: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]
Example Output: [98, 79, 97, 65, 71, 43, -72]

Example Input: [[-127, -77, -67, -136, 7, -194, 2], [78, -29, -159, -9], [-160, -161, -26, -142, -97], [-138, 43, -143, -5, -192], [23, -155], [-194, -100, -98], [36, -100, -150], [-109, -45, -76]]
Example Output:
[7, 78, -26, 43, 23, -98, 36, -45]