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]: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[A]: [0, -131, 75, 100, 90, 95, -24, 13, 10]


[Q]: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]
[A]: [-11, 69, 79]


[Q]: [[-26, 74], [98, -182, -116, -115], [-40, -168, -87, -135, -52, -183, -187], [-37, -95, 80, -33, -191], [-132, 82, 62, -75], [-118, -84, 30], [18, -58, -169, 45, 39]]
[A]:
[74, 98, -40, 80, 82, 30, 45]