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]: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
[A]: [81, 84, -3, 93, -41, 21, 6, 87, -16]


[Q]: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
[A]: [89, 47, 19, -36]


[Q]: [[47, -10, -171], [-30, -71, -116, 72, -171], [43, -120, -10, 12], [-146, 74, -169, -121, -136, -13, 18], [-195, 97, 95, 53, -91, -2, 16]]
[A]:
[47, 72, 43, 74, 97]