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: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

SOLUTION: [36, -23, 76, 20]

PROBLEM: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

SOLUTION: [28, 70, 52, 63, -145, 11]

PROBLEM: [[-159, -163, 88], [-155, -101, 7, 3, -68], [-159, -150, -122, -71, -77, -102, 71], [-181, -3, -156, 33, 34, -197, 13], [-61, -32, -101, 89, 19, -73], [-1, 7, -77, 21, -199], [13, -25, -112, -38], [-163, -69, 22, 78, 48, 60]]

SOLUTION:
[88, 7, 71, 34, 89, 21, 13, 78]