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]: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]
[A]: [83, 87, 54, -18, 51, -13]


[Q]: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
[A]: [86, 46, -128, 81, 40, 67]


[Q]: [[96, -86, -167], [-158, 85, -112, 46, 85], [18, -68, -189, -46, 32], [68, -11, 58, -173]]
[A]:
[96, 85, 32, 68]