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: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]

A: [79, 88, 93, 89, 32, 40]
****
Q: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]

A: [20, -71, 9, 97, 46, 17, 90]
****
Q: [[-118, -102, -93], [-111, -25, 70, 2, -89], [-150, 18, 93, 81, 28], [-184, -21, 68, 0, 30, -136]]

A:
[-93, 70, 93, 68]
****