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]: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[A]: [49, 34, 10, 52, 78, 31, 30, 18]


[Q]: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[A]: [17, 85, 20, 70, 12, 73, 90, 59, 58]


[Q]: [[-79, -129, -94, -149, -65, 68], [-23, -3, -160, -74], [96, 62, 62, -53, -146], [1, -136, -191, -188, -181, -179, -89], [-134, -116]]
[A]:
[68, -3, 96, 1, -116]