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: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]

A: [66, 16, 16, 69, 12, 80]
****
Q: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

A: [58, 54, 100, 65]
****
Q: [[6, -24], [-137, -101, -42, -74], [-90, -4], [-72, -69, 66, 86, -121, -78], [-187, 26, 34, -18, 88, -167], [-21, 64], [-60, -79, -37]]

A:
[6, -42, -4, 86, 88, 64, -37]
****