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: [[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]

A: [77, -137, 76, 92, 89, 61, -126, 98, 62]
****
Q: [[77, -129, -165, -23, -25, 84], [-148, -184, -130, -48, 66], [12, -10, -184, -198, -76], [-15, -102, 62, 49], [32, -91]]

A: [84, 66, 12, 62, 32]
****
Q: [[-125, 31, 75, 11], [21, -120, -65], [-140, -103, 64], [-150, -103, -16, -87, -58, -150, -152], [49, -181]]

A:
[75, 21, 64, -16, 49]
****