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: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
Example Output: [100, -120, -94, 63, 50, -139, 80, 56, 88]

Example Input: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
Example Output: [-137, 8, 71, 30, 12]

Example Input: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]
Example Output:
[67, 90]