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: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]

SOLUTION: [-110, 37, 0, 24]

PROBLEM: [[-70, -183, -171, 49, -87], [-53, -85, -127, -81], [-62, -55, -77, -17, -96, -186]]

SOLUTION: [49, -53, -17]

PROBLEM: [[-197, -13, -51, 18, -79, -85], [-145, 84, 99, -54, -145, -167, -194], [93, -17, -61], [34, 86, 29, 70, -12, -57, -200], [-77, -198], [84, -8], [63, -17, -40, -171, -31], [-17, -3, 26, -169]]

SOLUTION:
[18, 99, 93, 86, -77, 84, 63, 26]