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]: [[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]
[A]: [-134, 11, 21, 86, -74, 18, 81, 92, 79]


[Q]: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[A]: [83, 59, 65, 56, 83, 99, 98, 15, 82]


[Q]: [[-144, 58, 51, -198, 13, -121], [-178, -151, -173, -68], [-37, -184], [-191, -193], [84, -181, 58], [-70, 83], [-34, -108, 9, -81]]
[A]:
[58, -68, -37, -191, 84, 83, 9]