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: [[2, -34, -18, 14, -118], [-83, -168, -91, -189, -43, -84], [-3, -67], [-99, -66, -24, -133, 4, 14], [56, -148], [-148, 61, -10], [-105, -19, -19, -23], [-11, 97, -151, -180, -160], [-74, -14, -67, -75, -111]]

Output: [14, -43, -3, 14, 56, 61, -19, 97, -14]


Input: Consider Input: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

Output: [14, -86, 34, 47, -117]


Input: Consider Input: [[-155, -124], [-6, 60, -3, 93, -15, 74], [94, 82, -161, -182, 54, -8, -108], [28, -146, -156, -167, -174, 4, 24], [-101, -177, -67, 41], [-54, 75], [-186, -103, 18, -133, 17, -143, -17], [55, 29, 14], [14, -163, -139]]


Output: [-124, 93, 94, 28, 41, 75, 18, 55, 14]