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]: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]
[EX A]: [49, -27, -132, 98, 73, 74]

[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, -51, 17, -135, -4], [-4, -184, -56, 80], [-3, -110, -178, -38, -121]]
[EX A]:
[17, 80, -3]