TASK DEFINITION: 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.
PROBLEM: [[-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]]

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

PROBLEM: [[-38, -147, 7, 87, 35, -6, -90], [-83, 85, -60, -52, 8, -114, -191]]

SOLUTION: [87, 85]

PROBLEM: [[-199, -50, -163, -150, 11], [-177, -158, 79, 81, -53], [-1, -21, -173, 64, -4], [95, -54], [73, -152, -158], [38, 78, -188, -14, -185], [71, -55, 76, 83, -72, -163, 77], [23, 53]]

SOLUTION:
[11, 81, 64, 95, 73, 78, 83, 53]