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: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]

Output: [-6, 51, 71, 98, -30, 26]


Input: Consider Input: [[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]

Output: [19, 62, 44]


Input: Consider Input: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]


Output: [-76, -61, 22, 62]