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: [[-59, 44, -29], [-168, -64, -74, 51, -166], [-22, -130, -9, -67, -98, 46, -114]]

A: [44, 51, 46]
****
Q: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]

A: [55, 51, 83, 61, -9, 67, 15]
****
Q: [[58, -61, 45, -170, 15, 24, -72], [56, -179, 56, 6, -193, -51], [51, -109], [2, -177, -190, -14, 99, -179, -7], [-32, 92, -198, -46], [-186, 75, -184]]

A:
[58, 56, 51, 99, 92, 75]
****