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, 48, 81, 67, 22, 14], [-78, 84]]

Output: [89, 84]


Input: Consider Input: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]

Output: [83, 59, 65, 56, 83, 99, 98, 15, 82]


Input: Consider Input: [[18, -87, -33, -16, 22], [70, -120, -28, 0], [77, -69, -172, -145]]


Output: [22, 70, 77]