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]: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]
[A]: [-12, 8, 76, 96, -36]


[Q]: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]
[A]: [83, 79, 34, 49, 11, 75, -6, 67, -96]


[Q]: [[-143, 77, -10, -133, -200], [-114, -157, -13, -23, -67], [-27, 85, 30, -153], [-171, -42, 13, -74, -112, 36, -26], [-144, -2, 69, 98, -176, 85, -98], [-117, -179, -169, -187, -142, 55], [-13, -39, -148]]
[A]:
[77, -13, 85, 36, 98, 55, -13]