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]: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]
[EX A]: [-2, 57, 97, 30, 24]

[EX Q]: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]
[EX A]: [29, 63, 12, 34]

[EX Q]: [[51, -35, 81, -119, -4], [-87, 27, -39, -170, -89], [-107, -180, -87, -106, 10, -51, 15], [-139, -19, -118, -119, -189]]
[EX A]:
[81, 27, 15, -19]