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: [[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]

SOLUTION: [-134, 11, 21, 86, -74, 18, 81, 92, 79]

PROBLEM: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

SOLUTION: [-6, 36, 29, -46, -41, 35]

PROBLEM: [[-32, 56, 71, -86, -175, -82, -24], [-132, -172, -41, -100, 86], [-179, 69, 26, 88, 17], [-101, -107, -51, -77, -122, -120], [-92, 69, -162]]

SOLUTION:
[71, 86, 88, -51, 69]