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: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]

Output: [76, 41, 90, 32, 39]


Input: Consider Input: [[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

Output: [-84, 64, 62, -1, 88, -71]


Input: Consider Input: [[-63, -101, -176, -136], [91, 99, -167, 86, -140, -25, -58], [-170, 68, -189], [42, 6, 48, -166, -58, 52, -168], [16, 56, 67, -80, -165, -166]]


Output: [-63, 99, 68, 52, 67]