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]: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[A]: [52, 80, 98, 38, 69, 81, 8, 64]


[Q]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[A]: [95, 47, 66, 75, 33, 72, 9]


[Q]: [[64, 80, -172, 64, -40, -80], [40, -194], [-191, -24, -117, -46], [-158, -61, -24, 14, -67], [-100, -199, 66], [-67, -103, 75, -105, 56, -28, -131]]
[A]:
[80, 40, -24, 14, 66, 75]