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: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Output: [78, 70, 89, 9]


Input: Consider Input: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

Output: [51, 69, 92, 52, 82, 70, 65]


Input: Consider Input: [[-157, 29, -103, -151, -46, 75], [-172, -149, 14, -21, 74], [-153, -101, 34, -113, 48, -116, -182], [-179, -169], [23, -184, 17, -187, 27, -27]]


Output: [75, 74, 48, -169, 27]