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]: [[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]
[A]: [72, 36, 32, 2, 44, 89]


[Q]: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[A]: [-111, 83, -8, 92, 55, 91, 70]


[Q]: [[63, 7, -103], [4, -102, -87], [-44, -164, -118, -1], [-33, 60, -31, -123], [26, 36, 4, -106], [-152, -20], [-127, -79, -191, -23, -78, 76], [35, -89, 4, 62, -168, -60, 31], [-145, 46, -126, -37, 74, 68]]
[A]:
[63, 4, -1, 60, 36, -20, 76, 62, 74]