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: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
Example Output: [0, -131, 75, 100, 90, 95, -24, 13, 10]

Example Input: [[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]
Example Output: [72, 52, 84, 84]

Example Input: [[-36, 89, -165], [-89, 13, -182], [-80, -193, -73, 10, 89, -93, 55], [-25, 62, -51, 84, -104], [-101, 81, -164, -91, -72, -168, -79], [51, -97, -67, 17, 74], [-160, -147, -50, -144, -61], [-29, 24, -82, -39, -94, -189, -125], [8, -175, -21]]
Example Output:
[89, 13, 89, 84, 81, 74, -50, 24, 8]