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: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
Example Output: [81, 84, -3, 93, -41, 21, 6, 87, -16]

Example Input: [[-178, -24, -99, -81, 71], [-131, -183], [-37, -150, -140, -23, -184, -51], [-129, -54, -61, 0, 40, -94, 12], [17, -70, -72, -74], [-179, -192, 65, -65, -95, 82, -131], [15, -125, 49], [-106, -35, -178, 25], [58, -85]]
Example Output:
[71, -131, -23, 40, 17, 82, 49, 25, 58]

