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: [[-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: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]

Output: [98, 30, 96, 87, 96, 67, 53]


Input: Consider Input: [[-105, -153, 51, 33, -199, -133], [-59, -89, -95, -111], [-48, -1, 59], [-136, 43], [-128, 39, -160], [-16, -128, -166, 11]]


Output: [51, -59, 59, 43, 39, 11]