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.

Input: Consider Input: [[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]

Output: [-59, 78, 25, 94, 91]


Input: Consider Input: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

Output: [29, 63, 12, 34]


Input: Consider Input: [[-165, 18, -139], [30, -63, -142, -120, -101]]


Output: [18, 30]