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: [[-187, -74, -95, -170, -190, -61, -119], [-151, -197], [63, -132, -145, -124], [-169, -69, -48, -114], [-31, -89, -187, -198, -63, 2], [66, 19]]

A: [-61, -151, 63, -48, 2, 66]
****
Q: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]

A: [79, 83, 25, 75, 98, 92, 84, 92, 28]
****
Q: [[51, -46, -109, -87, -199], [-165, 96, 95, 29, -118, 58, -46], [83, -121, 45, -143], [7, 98], [0, 21, -18, 4, 93]]

A:
[51, 96, 83, 98, 93]
****