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: [[-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: [[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]

A: [65, 45, 9]
****
Q: [[-86, -58, -104, -165, -106, -85], [-25, -79, -9, 33, 18, -25], [-143, -164], [96, -62, 7, -144, -36, -178, -49], [27, -98, 14, -186, -172], [-18, -157, 77], [39, 11, -199], [6, -75, -170, -69]]

A:
[-58, 33, -143, 96, 27, 77, 39, 6]
****