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: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

Output: [89, 47, 19, -36]


Input: Consider Input: [[44, 37, -10, 4, -109, 87], [-62, -48, 51, -171, -162], [-41, 10, -49, -32, -116], [89, 100, -192, -33, -41, -17, -19], [86, 16], [-92, -131, 2, -25, 10, -84, -124], [-119, 77], [58, 23], [-103, -64, -166, 74]]

Output: [87, 51, 10, 100, 86, 10, 77, 58, 74]


Input: Consider Input: [[-84, -140], [-2, 42, -185, -87], [-50, 8, 64, 99, 75, -89], [54, -173, -108], [-82, -63, -85, 41, -82], [-161, 75], [-98, 12, -185, -112, 81, -192, -151], [54, -82, -63, -39]]


Output: [-84, 42, 99, 54, 41, 75, 81, 54]