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]: [[-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]: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]
[EX A]: [64, 55, 92, 95, 72, -29, 63]

[EX Q]: [[28, -167, -36, 12], [-158, -122, -95, -81]]
[EX A]:
[28, -81]