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]: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
[A]: [76, 29, 94, 94]


[Q]: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]
[A]: [17, 69, 96, 75, 36, -151]


[Q]: [[61, -105, -170, -98, -133, -57, -170], [-192, -37, 79, 91, 85, 8], [-10, 18, -98], [-31, -131, -41, -194, 80, -69, -95], [31, -102, 44, -120, -34, -67], [-188, -120, -110, 31, -26], [-86, -198, -144, 83, -194, -28]]
[A]:
[61, 91, 18, 80, 44, 31, 83]