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: [[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]

A: [76, 90, 90, 47, 94, 92]
****
Q: [[69, -92, -181, 13, 31, -185], [-14, -145, -116, 13, -132, 90, 0], [-188, -25, -182, -101, 14]]

A: [69, 90, 14]
****
Q: [[-66, -29], [-73, -190, -82], [-174, -78, -135, -113, -26], [-192, -74, -192, 64, -134, -16, -15], [-140, -181, -179, 11], [-9, -121, -138, -143, -64, 28], [-66, -71, 60]]

A:
[-29, -73, -26, 64, 11, 28, 60]
****