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: [[92, -175], [-99, -116]]

A: [92, -99]
****
Q: [[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]

A: [49, 24, -92, 80, 19, 93, 100, 42, 84]
****
Q: [[-52, -90, -31, -130, -45, 85], [-96, 26], [-57, -55, 25, 88, 38, 55], [-11, 55, 64]]

A:
[85, 26, 88, 64]
****