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]: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]
[EX A]: [90, -12, 100, 6]

[EX Q]: [[-64, -3, -2, -22, -84, -12], [-36, -191, -120, 10, -78, -105], [39, -185, -109, -111, -136], [-67, -119, 16, 0, -160], [-156, 38, -124, -189], [-42, -151, -157, 72, 11, -39], [3, -199], [-94, -71, 61, -21, -47, 14, 90], [-167, 20]]
[EX A]:
[-2, 10, 39, 16, 38, 72, 3, 90, 20]