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: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

A: [31, -1, 65, -15, -38, 59, -23]
****
Q: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]

A: [89, -13, 20, 92, 100, 13, 6, 88, 71]
****
Q: [[77, 19, -24], [-184, -108, -63, -170, -46, -80, -185], [-87, -89, 77, -5, 77, -46, -156]]

A:
[77, -46, 77]
****