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: [[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]

A: [49, 68]
****
Q: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

A: [24, -39, 95, 71]
****
Q: [[52, -131, -42, -104, 14], [75, 41, -164, 99], [-92, -109, -6, 26, -81, -2], [-196, -150, -42], [-75, -99, 21, 17, -11], [-18, -75, -11, -101]]

A:
[52, 99, 26, -42, 21, -11]
****