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]: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]
[A]: [58, 54, 100, 65]


[Q]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[A]: [63, 2, 29, 18, 98]


[Q]: [[18, -99, -23, -10, 61], [-180, 86, -132], [-118, -26, -143, 100], [71, -100], [-175, 78, -35], [-188, -25, 3, -125, 66, -172, -30], [88, -5, 13], [27, 93, -146, 6, -162, 77, 68]]
[A]:
[61, 86, 100, 71, 78, 66, 88, 93]