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]: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]
[A]: [83, 91, 46, 53, 29, 77, 52, -68, -33]


[Q]: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[A]: [83, 48, 83, 53, 35, -103]


[Q]: [[-134, -143, -55], [-186, -93, -104, -45, -36], [22, 1, -68, -78, -179, -108, -92], [-60, -12, 92, 34], [-98, 13, -60, -145], [-94, 64, -29], [40, 93, -34, -104, -77, -44, 18]]
[A]:
[-55, -36, 22, 92, 13, 64, 93]