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: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]

Output: [97, -35, 7]


Input: Consider Input: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]

Output: [93, 68, 96, 94, 81, 71]


Input: Consider Input: [[97, -58, -180, 0, -105, -176, -190], [-74, 8, -58, -30, -29, -97, -25], [92, 40, -200], [-89, -108], [-54, 98, -9, 26], [79, -185, -167, -54, -129]]


Output: [97, 8, 92, -89, 98, 79]