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: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]

A: [78, -36, 49, 35]
****
Q: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

A: [-33, 49, 37, -34, 92, 57, 19, 72, -92]
****
Q: [[-94, -35], [41, 73, -26], [-46, -93], [-192, -85, -153, -16], [-32, 22, -99, -181, 22, -154, 73], [84, 20, -180, -114, 1, -5, -119]]

A:
[-35, 73, -46, -16, 73, 84]
****