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: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]

A: [-37, 94, -21, 76, 85, 93, 72, 5, 87]
****
Q: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

A: [11, 41, 90, 72, 34, 56, 91, -133]
****
Q: [[-192, -111, 72, -81, -187, -139, 42], [17, 38, -55, 75, -34, -189, -164], [42, -57, -116], [-163, -94, -106, 19, -182, 95, -163], [36, 69, -69], [-30, -136, -192, -179, 61, -64]]

A:
[72, 75, 42, 95, 69, 61]
****