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: [[-62, 3, -118, -146, 75, -150], [3, -126, 64, -23], [64, 28], [-90, 57, 97, -92, -179]]

Answer: [75, 64, 64, 97]


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: [[-83, -45, -141, 94, -51, -181, 34], [-22, -17, 33, 75], [-119, 82, 23, -101, -126, -195], [3, -49, 19, -193, -66], [0, 75, 82, 39, -109, 78], [-10, 38, 18, 16, 58], [-1, -39, -158, 38]]

Answer:
[94, 75, 82, 19, 82, 58, 38]