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, 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: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

A: [1, 62, 100, 26, 85, 56, -9]
****
Q: [[-160, -187, -103, -103, -147, 35, 20], [-18, -172, -82, -29, -152, 4], [89, -177, 38, 97, -14], [-134, -163, -90, 57, 40], [100, 55, 70, -148, -158, -154], [3, -170, -102, 14, 27], [-170, -181, -5, -110]]

A:
[35, 4, 97, 57, 100, 27, -5]
****