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]: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]
[A]: [22, -12, 60, 59, -8, 90]


[Q]: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]
[A]: [93, 57, 98, 60, 15, -64, -9]


[Q]: [[42, 70], [-108, 19, 3, 38, -80], [-80, -151, -134, -21, -131], [91, -105, -83, -13], [-104, -114, -140, 80, -165], [88, -112, 2, -94, -67], [-62, -9, -61, -110], [12, -81, 77, -75], [53, -34, -77, -31, -13, -156]]
[A]:
[70, 38, -21, 91, 80, 88, -9, 77, 53]