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: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]

Output: [49, -27, -132, 98, 73, 74]


Input: Consider Input: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

Output: [53, 64, -34, 92, 22, 82, 85, 81, 43]


Input: Consider Input: [[66, -193, -198, 39, -80, -2, -7], [-21, 36, -79, -159, 51, 6, -83], [-166, -140, -77]]


Output: [66, 51, -77]