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: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

A: [99, 1, 16, 19, 62]
****
Q: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

A: [94, -107, 43]
****
Q: [[-158, 91, -139, -109, 35, -56, -198], [20, 24], [-89, 47, -79, 25, 47], [-103, -124], [-64, -186, 88], [-181, -183, -6, 52, 58, -107]]

A:
[91, 24, 47, -103, 88, 58]
****