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: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

A: [64, 55, 92, 95, 72, -29, 63]
****
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: [[-130, -76], [-117, -180, 6], [-87, 18], [-200, -80, 78, -107, -116, 18, 92], [6, 34, 19, -14, -195, -128, -71], [-21, 86, 38, 64], [-128, -175, 19, 82]]

A:
[-76, 6, 18, 92, 34, 86, 82]
****