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.
--------
Question: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

Answer: [18, 79, 47, 72]


Question: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]

Answer: [79, -33, 2, 42, 81, -142, 71]


Question: [[80, 99, 56, -154, 13, 74, -188], [-119, -80, -6, 62, -158], [-163, 27, -162, -89, -194], [-111, -39, -165, -137, 65], [-185, -92, 71, 52], [64, -31, -187, -51, -103, -69, 46]]

Answer:
[99, 62, 27, 65, 71, 64]