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]: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
[A]: [76, -74, 73, 57, 41]


[Q]: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]
[A]: [65, 75, 69, 44, 52, 16]


[Q]: [[10, 20], [-47, -191, -200, -62, -34, -100, -183], [78, -116, 34, -62], [-23, -194, 83], [-160, -89, -81, -23, 38, -60, 37], [27, -151, 27, 13, -7, 79, 21], [-139, -39], [-26, 47]]
[A]:
[20, -34, 78, 83, 38, 79, -39, 47]