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: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

A: [-20, 93, 17, 91, 69, 44, -21, 98, 25]
****
Q: [[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]

A: [-15, -18, -37, 97, 90, 96, 66]
****
Q: [[-22, -37, 12, -171], [-90, 65, -126, -136, -121], [-185, 14, 36, -109, -68, -165, 45], [-63, -133, -48, 15, -149, -17], [-176, -58, 16, 64, 11], [-180, 25, -37, 46, 11]]

A:
[12, 65, 45, 15, 64, 46]
****