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.

Example Input: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
Example Output: [49, 34, 10, 52, 78, 31, 30, 18]

Example Input: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
Example Output: [76, -74, 73, 57, 41]

Example Input: [[-183, 84, 11, -24], [94, -54, -73, -112, 43, 98], [-141, -85, 63, -103], [-188, -188], [42, -150], [39, -148, -136, -119, 64], [-118, 96, -28, -98, 7, 57, 78], [-85, 12, -158, -1, -118, -26, -29]]
Example Output:
[84, 98, 63, -188, 42, 64, 96, 12]