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: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

A: [14, -86, 34, 47, -117]
****
Q: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

A: [78, -56, -80, 89, -112, 49, -93, 91, -94]
****
Q: [[-177, -18, 81, -144, -143], [97, 96], [64, -58, -114, 33, 89, 5], [-46, 56, 85, 58, 93], [-90, 8, 1, 62]]

A:
[81, 97, 89, 93, 62]
****