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: [[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]

A: [81, 84, -3, 93, -41, 21, 6, 87, -16]
****
Q: [[-102, 46, -150, -150], [-151, -137]]

A: [46, -137]
****
Q: [[73, -92, -9, -9], [52, 67], [-59, 4, -195, 9, -82], [45, 99, -118, -199], [-49, -94]]

A:
[73, 67, 9, 99, -49]
****