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: [[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: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]

Output: [86, 56]


Input: Consider Input: [[-58, -77, -122, -180, -74, 59], [-152, -36, -17, -25]]


Output: [59, -17]