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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

A: [67, 90]
****
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: [[-116, -79, -179, 100, -73, -25], [-168, 65, -74, -138, -25, -166]]

A:
[100, 65]
****