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: [[-89, -60], [75, -56]]

A: [-60, 75]
****
Q: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]

A: [88, 85, 41, 13, 42, 42, -35, 17]
****
Q: [[57, -79, -32, 19], [-168, -189], [35, -23, -56], [13, -194, -191, -102], [-90, -27, 90, -66, -16], [-121, 43, -188], [9, 34, 81, -62, -176, -185], [-112, -74, -101, -67], [-195, -98, -194, -113, -54]]

A:
[57, -168, 35, 13, 90, 43, 81, -67, -54]
****