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]: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]
[A]: [67, 26, 7, -16, 78, 79, 4, 85, 35]


[Q]: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[A]: [78, 86, -72, -153]


[Q]: [[-68, -120, -164, -59, -49], [41, -125, 35, -142], [-131, -30, 0], [16, -128, 89, -194, 46, -113, 62], [-181, -104, 77], [-181, -68, 86], [76, -96, 64, -190, 71, 87, -171], [-192, -101, -21]]
[A]:
[-49, 41, 0, 89, 77, 86, 87, -21]