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: [[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]

Output: [65, 75, 21, 82, 4, -3, 21]


Input: Consider Input: [[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]

Output: [5, 82, -91, -71, 46, -23, 68]


Input: Consider Input: [[-48, -65, -96], [-22, -7, -121], [-140, 55, 92, -143], [-185, -94, -19], [-25, -182, 11, -170, 44], [31, -105, 68, -32, 53, 79, 27]]


Output: [-48, -7, 92, -19, 44, 79]