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]: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[A]: [52, 80, 98, 38, 69, 81, 8, 64]


[Q]: [[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]
[A]: [33, 34, 68, -13]


[Q]: [[-56, 72, -62, -78], [71, -111, -83, -43, 69, -35, -44]]
[A]:
[72, 71]