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: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]

A: [65, 97, 17, 33, 14, -38]
****
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: [[-125, -108, 85, -103], [-15, 59], [-84, -56, -138, -130, -164], [-75, -176, -197]]

A:
[85, 59, -56, -75]
****