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: [[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]

A: [44, 72, 91, 14, 85, 99, 81]
****
Q: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]

A: [-20, -50, 86, 95]
****
Q: [[-15, -181, -174, 62, -161, -22], [-97, 42, -135]]

A:
[62, 42]
****