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, -185, 24], [38, 8, 46, 27, -43, -100]]

A: [79, 46]
****
Q: [[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]

A: [29, 85, 99, -7, -27, -3]
****
Q: [[-56, -137, 47, -196, 73, -90, 99], [-145, 60, -165, -186], [-11, 84, 51, -86, 95, 30, -9], [-182, 3, -105, -119], [-128, -34, -73, -45], [-44, -191, -120], [-73, -96], [-2, -63, 0, -48], [-34, -8, 12, -4, 17, -42, 13]]

A:
[99, 60, 95, 3, -34, -44, -73, 0, 17]
****