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]: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]
[EX A]: [65, 75, 69, 44, 52, 16]

[EX Q]: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]
[EX A]: [83, 83]

[EX Q]: [[-136, 68, -87, -44, -80, -98], [-45, -138, -149, -151], [-34, -146, 26, -135, -175], [-69, -53, 97], [-194, 24, 28, 6, -73, -59], [-89, -119, -7, -96, -1, -26], [63, 97, -157, -33, -135], [-25, -194], [-39, -23, -196, -190, 93, 20, -138]]
[EX A]:
[68, -45, 26, 97, 28, -1, 97, -25, 93]