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: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]

A: [-26, -3]
****
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: [[-172, -127, -149, 62, -126, 31, -152], [21, 71, 13, -98, -191], [-153, -25, -106, -181], [24, -105, 44], [-192, -126, -89, 10, -98, -51, 13], [-43, -168, -155, -50, -107, -95, 56]]

A:
[62, 71, -25, 44, 13, 56]
****