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: [[92, 72, -149, -138, -138, -155, -174], [50, -85, -69, -41], [-48, -72, -116, -197], [70, -140, -34, -178], [1, 50, -175, 18], [-127, -73, -45, -68, 30, -175, -65], [-53, -178, 6, 14, -158, -176, -112], [7, -183], [62, -91, 38, -46, -126]]

SOLUTION: [92, 50, -48, 70, 50, 30, 14, 7, 62]

PROBLEM: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]

SOLUTION: [97, 90, 93, 52, 52, -29, 37, 79, 80]

PROBLEM: [[71, -74], [-145, -139, -19, -146, -135, -175], [-194, -82, 29, -44], [-20, -170, 24, 85, -135], [-190, 43, -136], [45, 86, -19, -108, -119, -184, -121], [-37, -35, -28, -12], [-13, -196, -94, -49, -39, -157], [-15, 69, 61, -31, -156, -63]]

SOLUTION:
[71, -19, 29, 85, 43, 86, -12, -13, 69]