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]: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]
[A]: [78, -36, 49, 35]


[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]: [[18, -100, -3, 63], [-87, -118, -57, 10], [-90, -184, 76, -180], [-15, -72, 10, 80, -114], [83, -96], [-65, -57, 85, -136, -164, -126, 90], [-44, -187, -158, -151, -126, -62, -16], [96, 66, 36, -46, -140], [34, -156, -18, -142]]
[A]:
[63, 10, 76, 80, 83, 90, -16, 96, 34]