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: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

Output: [47, 40]


Input: Consider Input: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

Output: [60, -36, 94, 68, 36, -64, 41]


Input: Consider Input: [[-104, -40, -118, -152, -157, -163, -182], [-129, -128, -163, -30, 63, -84], [-155, -91, -33, -84, -126], [50, -89], [-49, 97, -92, -134, -28, -36], [26, 42], [-138, 43, -68]]


Output: [-40, 63, -33, 50, 97, 42, 43]