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]: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
[A]: [98, 56, 93, 13, 28, 59, 74]


[Q]: [[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]
[A]: [55, 94, 89, 30, 77, 87]


[Q]: [[-44, -112, -44, -59], [-31, -47, -170], [88, -73, 4, -182, -172, -95], [-193, -174, 16, -134, 50, -35, -102]]
[A]:
[-44, -31, 88, 50]