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: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

A: [45, 33, 26, 69, 89, 95, 57, -4]
****
Q: [[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

A: [-163, 37, 98, 77, 58, 47]
****
Q: [[-41, 40, 10], [-22, -133, -51, -167, -70, -124], [59, 11, 0, 27, -122, 60], [-71, -160, 87, -167, -84, -197, -197], [-17, -135, -98, -55], [-28, -74, -145, 57, -25, 61, -180]]

A:
[40, -22, 60, 87, -17, 61]
****