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]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[A]: [99, 68, -32]


[Q]: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
[A]: [54, 44, 50, 12, 24, -28]


[Q]: [[56, -173], [-168, 81, -82, -80, -7, -188, -116], [-177, -16, -43, -164, 21], [-174, -105], [99, -125, -36, -110, -59, 1, 39], [-193, -151, 50, -79, 41, -91, 74], [19, -65, 2, 61, -88, 20]]
[A]:
[56, 81, 21, -105, 99, 74, 61]