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: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

A: [21, -38, 99, 89, 40, 46, 69]
****
Q: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]

A: [76, 29, 94, 94]
****
Q: [[23, -125, -78, -194], [-191, -197, 29, -147]]

A:
[23, 29]
****