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]: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]
[A]: [79, 83, 25, 75, 98, 92, 84, 92, 28]


[Q]: [[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]
[A]: [65, 75, 21, 82, 4, -3, 21]


[Q]: [[63, 90, -155, -94, 57], [78, -149, -151], [-162, -148, 43], [-92, -194, 63, 33, -103], [-127, -56, -10, -89], [-62, 97, 34, -78], [-156, -127]]
[A]:
[90, 78, 43, 63, -10, 97, -127]