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]: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]
[A]: [79, 88, 93, 89, 32, 40]


[Q]: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
[A]: [85, -8, 67, 45, 71, 91]


[Q]: [[-167, 39, 21, -10, -146, 29], [-70, -37, 41, -52, 62, -185, 81], [-17, -9, -46, -86, -36, 98, -188], [52, -110, -16, -110, -141, -171], [87, -182, 98, 79, -179, -182]]
[A]:
[39, 81, 98, 52, 98]