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]: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]
[A]: [44, 57, 55, 78, 8, -10, 13]


[Q]: [[-171, -130, -49, -198, 50, 76, -194], [-106, -107, -124, -85], [44, -56], [-198, -73, -197, -163, -138, 94, 15], [59, 83, 11, -116, -31], [24, -195, -62, -155, -124], [-175, -177, 1, -167], [-133, -90]]
[A]:
[76, -85, 44, 94, 83, 24, 1, -90]