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]: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
[A]: [47, 58, 99, -57, 92, -77, 30, 0, -38]


[Q]: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[A]: [82, 98, 76, 12, 58, 85, 9, 86]


[Q]: [[-2, -140], [98, -150, 53, -148], [-109, -77, -131, -45, -156, -140, 14], [7, -86, 85, -118, -86, -11, 12], [-172, -11]]
[A]:
[-2, 98, 14, 85, -11]