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]: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]
[A]: [58, 19, 68]


[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]: [[-117, -86, -134, 88, -183, -189, 12], [-91, -126], [36, 63, -200], [-121, -16, 96], [52, -142, -136, 69, -39], [34, -123, -185, -20, 48, 9, 75]]
[A]:
[88, -91, 63, 96, 69, 75]