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: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]
Example Output: [95, -53, 27]

Example Input: [[7, 52, -87, -23, 87], [-57, 60, 81, 44], [-16, -89, -89], [32, 39, -156, 64, 88, -164, -80], [30, -130], [-88, 26], [14, 5], [-4, -54, 91, 58, 73], [-197, -81, -196, -156, -31, -153, -163]]
Example Output:
[87, 81, -16, 88, 30, 26, 14, 91, -31]