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]: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
[A]: [97, -5, 47, -13, 95]


[Q]: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]
[A]: [78, 70, 89, 9]


[Q]: [[5, -191, -115, -140, -129, -16, -49], [-30, 44, 15, 12, -93], [8, -164, -154, 31, -139, 64, -47], [-59, 77, -56, -46, -75], [91, -127, -46, -20, -47], [-34, -189, -144, -151, 78], [-13, -196, -149, 96, 13, 18]]
[A]:
[5, 44, 64, 77, 91, 78, 96]