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: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

A: [37, 32, 34, -3, 97, 97, 68]
****
Q: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]

A: [100, 3, 97]
****
Q: [[27, -159, -190, 47, 65], [73, 66], [46, -127, 43, -153, -117, -163, -154], [-184, 72, 75], [-48, -188], [-83, -164, 59, -70, 12], [38, -44, 71, -110, -120, -4, 14]]

A:
[65, 73, 46, 75, -48, 59, 71]
****