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: [[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]

A: [-32, -72, 43, 59]
****
Q: [[-43, -132], [-19, 96, -88, -86, -39], [-58, -168], [-14, -9, -81, -146], [-114, -177, -130, 81, -128, -118, -161]]

A:
[-43, 96, -58, -9, 81]
****