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: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]

Output: [91, 82, 18, 46, 37, 17, 46, 74]


Input: Consider Input: [[-15, 98, -161, -134, -199], [67, -153, 7, 98, 47, -89], [-161, -195, -191, -177, -148, 19, -122], [-55, -4, -157], [-31, 61, -12, -172, -8], [51, -152, -25, -65, 19, 9], [39, -138, -184, -155, 40, 29, -196], [-18, -79, 49]]


Output: [98, 98, 19, -4, 61, 51, 40, 49]