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: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

A: [94, -107, 43]
****
Q: [[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]

A: [5, 82, -91, -71, 46, -23, 68]
****
Q: [[34, 7, -21, 0, -170, -28], [-143, -77, -136, 29, -79], [-192, -70, 40, 84, 48, -115, -120], [-187, -110], [70, 45, 44, 99, 49, -197, -21], [-121, -57, -9, -154, 80], [-65, -105, 47, -107, -191, 75, 52], [86, 56, 1, 97, 37, -109]]

A:
[34, 29, 84, -110, 99, 80, 75, 97]
****