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: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

A: [53, 41, 80, 98, 91, 62]
****
Q: [[99, -101, -88, 15, -73], [38, -143, -93, 43, -104, 48], [-39, -90, 31], [-146, 49, -10, 77, -49, -177]]

A: [99, 48, 31, 77]
****
Q: [[-155, -28, 63, -3], [-18, -138, -19, -46, -197], [6, -54, -49, -101], [-12, 77, -178, 45, -193, 60, -34], [-112, -92, -15, -81, 63], [14, 82, 49], [26, 61, 62]]

A:
[63, -18, 6, 77, 63, 82, 62]
****