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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

SOLUTION: [82, -53, 34, 100, 65, 57, 65, 58, -101]

PROBLEM: [[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

SOLUTION: [82, -35, 37, 86, 1, 46, 99]

PROBLEM: [[-113, 92], [-172, -41, 61, -100, 53, 33, 42], [-67, -78], [12, 76, 17], [47, -61, 51, -46, -60, 23, -140]]

SOLUTION:
[92, 61, -67, 76, 51]