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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

Output: [82, -53, 34, 100, 65, 57, 65, 58, -101]


Input: Consider Input: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

Output: [100, 84, -63, -55, 78, 58, 86, 99]


Input: Consider Input: [[-112, -75, -83], [56, -120, -53], [-81, -44], [-143, 58]]


Output: [-75, 56, -44, 58]