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: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]

A: [44, 57, 55, 78, 8, -10, 13]
****
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: [[93, 24], [55, -36, -59, -110], [-168, 90, -83, -160, -59, -130], [-80, -95, 9, 32, 57, 65], [2, 72, -153]]

A:
[93, 55, 90, 65, 72]
****