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]: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
[EX A]: [100, 97, 77, 11, 52, 74, 99, -25, 8]

[EX Q]: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]
[EX A]: [94, 24, 12]

[EX Q]: [[45, -77], [-168, -120, -25, -63, -119], [-114, -126], [-2, 81, 48], [-150, -4, 0, -148, 18]]
[EX A]:
[45, -25, -114, 81, 18]