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: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]

SOLUTION: [90, -4, 18]

PROBLEM: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

SOLUTION: [91, 53, 82, -9]

PROBLEM: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

SOLUTION:
[27, -10, 40, 78, 74, 22, 51]