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: [[-56, -17, -187], [-135, -22, 5], [41, -132, -73, -106, -40], [4, -165, -9, -32, -167, -112], [-73, -120, -55, -46, -49, -71], [80, -199, -188, 25, -12, 7], [-22, -124, -193, 28, 92, 27], [-183, -80, 7, -156, 65], [61, -127, -144, -99, -195, 69]]

Output: [-17, 5, 41, 4, -46, 80, 92, 65, 69]


Input: Consider Input: [[-19, -151], [33, 54, 85]]

Output: [-19, 85]


Input: Consider Input: [[16, -147, 57, -4], [-148, 45, 86], [-57, -71, 100, 21, -105], [32, -18], [-182, 88, 25], [89, 71, -114, -119], [-122, -46, 28, -160], [39, -165, 94, -21], [1, -30, 60, -176]]


Output: [57, 86, 100, 32, 88, 89, 28, 94, 60]