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: [[-194, -53], [76, -105, -182, -135, -156, -156], [22, -167, -59], [95, -6, -181], [97, 39, 52, -123, -64, 33, -137], [85, 38, -56, 59, -63], [22, -26, 13, -39], [-118, -51, 91], [24, 99, 93, -169, 80, 46]]

A: [-53, 76, 22, 95, 97, 85, 22, 91, 99]
****
Q: [[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]

A: [98, 72, 48]
****
Q: [[-148, -129, 100, 45, -80, -4], [25, -58, -46, -178, -122, 64, 52], [69, 15, -56, -6, 0, -189], [-177, -65, 7, -102, -121, -24, -130], [-136, 81, -72, -82], [-60, 67, -149, -63, 78, -70, -111], [-40, 62, -134, -116, -7, -146]]

A:
[100, 64, 69, 7, 81, 78, 62]
****