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: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]

A: [76, -40, 87, 30, 27, 27, 51]
****
Q: [[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

A: [98, 79, 97, 65, 71, 43, -72]
****
Q: [[90, -120, -88, -11], [83, -96, -45, -200], [75, -125, 89, 90, -199], [-76, 99, -41, -51, -37, -196, 9], [-56, -110, 17], [-36, -155, -84, 78, -120], [-127, -187, 27, 46, -75], [-176, -161, -44, -30, -32, -147, -81]]

A:
[90, 83, 90, 99, 17, 78, 46, -30]
****