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: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Output: [78, 70, 89, 9]


Input: Consider Input: [[-84, -87, 21, -86], [-136, -18], [-72, -29, -59], [-132, 36], [14, -48, -60, -63], [-91, -133, -108, 35, -76, -108, 45]]


Output: [21, -18, -29, 36, 14, 45]