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: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

A: [65, 53, 72, -30, 85, 38]
****
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: [[47, -156, -19], [-44, 14, -123, -55, -101], [83, 63], [-123, 1, -82, -152], [-114, -128], [20, -45, -100, -152]]

A:
[47, 14, 83, 1, -114, 20]
****