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: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

SOLUTION: [22, -12, 60, 59, -8, 90]

PROBLEM: [[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]

SOLUTION: [98, 57, 95, 99, 87, 76]

PROBLEM: [[15, -119, 52, 53, 87, -144], [12, -90, -4, -33], [-5, 87, -161], [-161, -118, 6, -110], [46, -48, 32], [-154, -71, -197]]

SOLUTION:
[87, 12, 87, 6, 46, -71]