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.

[EX Q]: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[EX A]: [61, 73, 78, 71, -99, 88, -30]

[EX Q]: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]
[EX A]: [8, -11, -47, 24, 61, -67, -11, 70, 10]

[EX Q]: [[-1, -9, 8, -55, -47, -154, -186], [8, -169], [57, -109]]
[EX A]:
[8, 8, 57]