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: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

Output: [67, 26, 7, -16, 78, 79, 4, 85, 35]


Input: Consider Input: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

Output: [95, -53, 27]


Input: Consider Input: [[-94, 86, -63, 9, -169, -93, 25], [-105, 22, 79], [-103, -190, -120], [78, -72, -147, -162, 41, -84, -64], [-190, -169]]


Output: [86, 79, -103, 78, -169]