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: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]

Output: [79, 83, 25, 75, 98, 92, 84, 92, 28]


Input: Consider Input: [[-101, -168], [17, 42, -110, 20], [83, -36]]

Output: [-101, 42, 83]


Input: Consider Input: [[95, -101, -188, -81, -50, 23, 72], [-118, 97, -135, -108, 41, -51], [91, -3, 75, -96], [-90, -102, -108, 24, -51], [66, -93], [33, -115, -40, 7, -162, 11], [-36, 29, 30, -53, 68, 33, -1], [-26, -92, 92, -59], [-108, 81, -98, 56, -36]]


Output: [95, 97, 91, 24, 66, 33, 68, 92, 81]