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: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]

A: [-11, 69, 79]
****
Q: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]

A: [79, 95, 82, 66, -11]
****
Q: [[-19, -149, 56], [-17, -193, -163], [6, -145, -81, -37, -67, 60, -111], [-181, 30, -41, -21, 32], [-119, 88], [87, 55, 82], [-176, -40, -114, 77, 19, 7], [-135, 87, -32, 83], [37, -102, 39, -192, -98]]

A:
[56, -17, 60, 32, 88, 87, 77, 87, 39]
****