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]: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]
[A]: [38, 25, -7, 1, 40, 92, 87, 76, -95]


[Q]: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]
[A]: [83, 87, 54, -18, 51, -13]


[Q]: [[-49, -180, -41, 3, 7], [-117, 10, 12, 100], [-20, -118, -136, -47, -22, -106, -93], [-95, 22, 95, -104, 78, -33, -10], [66, -9, -101, -92], [-63, -53, -194, 21, -177, -119, 63], [45, 64, 43, 57, -95, 45, 5]]
[A]:
[7, 100, -20, 95, 66, 63, 64]