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: [[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

A: [74, 78, -132, 63, 73, 39]
****
Q: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

A: [97, 23]
****
Q: [[-155, -64, 70, -142, -146, -96], [-17, 96, -119, -157], [-130, -190, -122, 69, -7]]

A:
[70, 96, 69]
****