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: [[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]

Output: [92, -28, 98, 72, 23]


Input: Consider Input: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]

Output: [56, -87, 97, 5, 75, 100, 39, 38]


Input: Consider Input: [[-175, 29, -110, 39], [-166, 42], [90, 44, -42, -76, -75, -29], [-186, -161, -42, 6], [63, 73, -146, 27], [-106, -40, -91, -141], [-39, -41, -119], [4, 50, -113], [-84, -18]]


Output: [39, 42, 90, 6, 73, -40, -39, 50, -18]