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: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]

A: [57, 40, 81, 17, 4]
****
Q: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]

A: [93, -40, -72, 13, 91, 35, 33, 28]
****
Q: [[86, 53, -171], [-148, -143, -147], [-44, -42, -12, -167, -26, 13], [3, 42, 0, 20, 44], [0, -175, 18, -161, 22, -105, -25], [-89, -49, -166], [-5, -168, -14, -12]]

A:
[86, -143, 13, 44, 22, -49, -5]
****