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: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

A: [100, 84, -63, -55, 78, 58, 86, 99]
****
Q: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]

A: [39, 6, 91, -7, 52, 99]
****
Q: [[-89, 45, -119], [-110, 37, 7, -51], [-95, -133, -173], [-4, 58, 31], [53, 73]]

A:
[45, 37, -95, 58, 73]
****