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: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]

A: [25, 59, -59, 90, 68, -84]
****
Q: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]

A: [53, 64, -34, 92, 22, 82, 85, 81, 43]
****
Q: [[-34, -26, -152, 39, 66, 15], [-27, -141, -64, 73, 27], [-51, 55, 90, 5, 9]]

A:
[66, 73, 90]
****