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: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

A: [52, 76, 70, 93, 26, 99, 12, 94]
****
Q: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]

A: [35, 82, 27, 58, -103]
****
Q: [[84, 58, -140], [-136, -41, -52, -155, 96, -58], [56, 80, 39, 31, -90, -13, 87], [-101, 81]]

A:
[84, 96, 87, 81]
****