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: [[-144, -114, 61, -172, 43, 35, 40], [82, 54, -184, -82, -75, -105, 97]]

A: [61, 97]
****
Q: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

A: [48, -87, 96, 54, 91, 58, -23]
****
Q: [[-24, 89, -56, -61, 26], [-172, 54, 21, -198, -143, 10], [15, -68, -161, -126, -124], [-193, 48, -200, 16, 5, -57, -63], [-29, 92, -106, -2], [-60, 68, -65, -38, -16], [85, -119, -83], [82, -165, -155, -103, -10, -36, 69]]

A:
[89, 54, 15, 48, 92, 68, 85, 82]
****