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: [[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]

A: [89, 85, 85, 1]
****
Q: [[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]

A: [72, 36, 32, 2, 44, 89]
****
Q: [[-62, 13, -106, -56, -45], [-27, -132, -131, 90], [-48, -70, 7], [30, -18], [11, 37], [-160, -99, -35, -16, -59, -192], [-131, 21, 1, 61, 24, -69], [-148, -167, -63]]

A:
[13, 90, 7, 30, 37, -16, 61, -63]
****