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: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

A: [91, -49, 89, 83, 92, -91]
****
Q: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]

A: [-17, -31, 56, 64]
****
Q: [[-190, 26, -64], [-200, 36, -5], [100, -91, -60, -160]]

A:
[26, 36, 100]
****