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, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

A: [41, -44, 34, 86, 26]
****
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: [[-34, -189, -107, -125, -117], [-163, -169], [-27, 59, 71, 71, -122, -40, -81], [-188, 66, -26, -38], [-125, -129, -132, -185, 79, 29, 13], [-38, -118, -167, -74], [100, -50, 20, 28, 47, 96, 50]]

A:
[-34, -163, 71, 66, 79, -38, 100]
****