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: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

A: [53, 34, 91, 40]
****
Q: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

A: [24, -39, 95, 71]
****
Q: [[79, -119, 57, 25, -160, -60], [90, -153, 38, 43], [-88, -179, -96, 61, 14, -130, -42], [41, -89, -132, -31], [-66, -18, 76], [-148, 76, -171, -103, -73]]

A:
[79, 90, 61, 41, 76, 76]
****