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]: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]
[A]: [40, 84, 55]


[Q]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[A]: [100, 84, -63, -55, 78, 58, 86, 99]


[Q]: [[56, -114, -124], [-41, -146, -84, 93, -14, 62, -170], [-54, -24, -69, 8, 48]]
[A]:
[56, 93, 48]