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: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]

A: [76, -40, 87, 30, 27, 27, 51]
****
Q: [[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]

A: [72, 52, 84, 84]
****
Q: [[-181, 43, 40, -78, 13], [11, 16, -123, -57, -48, 67, -186], [-112, -198, -14, 59, -176, -174], [-35, -4, -63, -104, 10]]

A:
[43, 67, 59, 10]
****