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.

Q: [[-157, -89, -63], [-97, 82, -159, 40, -15], [-25, 52, 24, 79, -114, 16, 54]]

A: [-63, 82, 79]
****
Q: [[-54, 43, 14, 3, -181, 28], [-137, -54, -62, -1], [40, -168, -120, -195, 17, -9, 6], [-100, 36, 80], [-9, 30, 73, 32]]

A: [43, -1, 40, 80, 73]
****
Q: [[89, -186, 57, -40], [27, 68], [-166, -166, -48, 70, 78, 99, -52], [-194, 84, -72], [-171, 65, 100, -135, -42, -114, -199]]

A:
[89, 68, 99, 84, 100]
****