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: [[-154, 7, -184, -33, 12, 15, 79], [-93, 56, -98, -134], [-47, -2, -1, -78], [-23, -55, 85], [36, -36, 69, 89], [-190, -46, -93, -121, 61], [-145, -172, -95, -160, -62], [31, -170]]

Output: [79, 56, -1, 85, 89, 61, -62, 31]


Input: Consider Input: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

Output: [90, -12, 100, 6]


Input: Consider Input: [[-197, 71, -106, -36], [-37, -47, -66], [25, -120, 14], [-182, -162, 17, -115], [10, -146, -189]]


Output: [71, -37, 25, 17, 10]