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: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

A: [27, -10, 40, 78, 74, 22, 51]
****
Q: [[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]

A: [92, 28, 99, 15]
****
Q: [[-171, 21, -65], [-1, 87, -132, 56, -34], [83, -140, 6, -116, -12], [-149, 85, 11, -148, -38, -178, 65], [-81, -116, -176, -37, 63, -152], [-183, -4, 87, -163, 90]]

A:
[21, 87, 83, 85, 63, 90]
****