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: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

A: [70, -48, -19]
****
Q: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

A: [-26, 31, -27, 94, 69, 47, 55, -8]
****
Q: [[-14, 6], [-78, 14, -100, 86], [-62, -136, 80, -178], [-157, -30, -64, -64], [-146, -103, -141, 24, 24, 85], [-175, -79], [-142, -11, 88, 27], [-195, -137, -42, -147, -50], [53, -70, -63, -131, 74]]

A:
[6, 86, 80, -30, 85, -79, 88, -42, 74]
****